Name		Name	Last commit message	Last commit date
parent directory ..
README.md		README.md
maximum-xor-of-two-numbers-in-an-array.go		maximum-xor-of-two-numbers-in-an-array.go
maximum-xor-of-two-numbers-in-an-array_test.go		maximum-xor-of-two-numbers-in-an-array_test.go

README.md

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, 2, 8]

Output: 28

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

见程序注释