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.java Find the maximum result of ai XOR aj, where 0 ≤ i, j < n.ide Could you do this in O(n) runtime?this Example:idea Input
相关文章
相关标签/搜索