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:
原创
2016-10-20 19:55:45 ·
402 阅读 ·
0 评论