421. Maximum XOR of Two Numbers in an Array
2017-02-21 13:01
344 查看
Given a non-empty array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai < 231.
Find the maximum result of ai XOR aj, where 0 ≤ i, j < n.
Could you do this in O(n) runtime?
Example:
http://blog.csdn.net/u014257954/article/details/52891685
Find the maximum result of ai XOR aj, where 0 ≤ i, j < n.
Could you do this in O(n) runtime?
Example:
Input: [3, 10, 5, 25, 2, 8] Output: 28 Explanation: The maximum result is 5 ^ 25 = 28.
http://blog.csdn.net/u014257954/article/details/52891685
相关文章推荐
- Maximum XOR of Two Numbers in an Array--异或、字典树
- Leetcode 421. Maximum XOR of Two Numbers in an Array 最大Xor和 解题报告【待理解】
- 421. Maximum XOR of Two Numbers in an Array
- LeetCode 421. Maximum XOR of Two Numbers in an Array 位运算求解
- Trie (3) -- Maximum XOR of Two Numbers in an Array
- leetcode 421. Maximum XOR of Two Numbers in an Array
- [leetcode]421. Maximum XOR of Two Numbers in an Array
- 421. Maximum XOR of Two Numbers in an Array
- [LeetCode] 421. Maximum XOR of Two Numbers in an Array(位操作)
- Maximum XOR of Two Numbers in an Array
- Maximum XOR of Two Numbers in an Array
- 421. Maximum XOR of Two Numbers in an Array
- LeetCode: 421. Maximum XOR of Two Numbers in an Array
- leetcode 421. Maximum XOR of Two Numbers in an Array
- leetcode 421. Maximum XOR of Two Numbers in an Array 最大的异或运算值 + 位运算
- [LeetCode] 421. Maximum XOR of Two Numbers in an Array(位操作)
- 421.Maximum XOR of Two Numbers in an Array 数组中异或值最大的两个数字
- 421. Maximum XOR of Two Numbers in an Array
- (LeetCode) 421. Maximum XOR of Two Numbers in an Array
- Leetcode-421. Maximum XOR of Two Numbers in an Array