421. Maximum XOR of Two Numbers in an Array

  • 44.0%

https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/?tab=Description

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?

1
2
3
4
5
6
7
Example:

Input: [3, 10, 5, 25, 2, 8]

Output: 28

Explanation: The maximum result is 5 ^ 25 = 28.

谢谢你,可爱的朋友。