Skip to content

Latest commit

 

History

History
19 lines (12 loc) · 411 Bytes

File metadata and controls

19 lines (12 loc) · 411 Bytes

158.Sort Maximum XOR of Two Numbers in an Array

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.

Example

Input: [3, 10, 5, 25, 2, 8]
Output: 28
Explanation: The maximum result is 5 ^ 25 = 28.

From

LeetCode