LeetCode 421. Maximum XOR of Two Numbers in an Array 位运算求解
题目:
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:Input: [3, 10, 5, 25
原创
2017-06-18 13:50:35 ·
313 阅读 ·
0 评论