leetcode/problems/maximum-xor-of-two-numbers-in-an-array at main · awesee/leetcode

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

< Previous 　　　　　　　　　　　　　　　　 Next >

Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n.

Example 1:

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

Example 2:

Input: nums = [0]
Output: 0

Example 3:

Input: nums = [2,4]
Output: 6

Example 4:

Input: nums = [8,10,2]
Output: 10

Example 5:

Input: nums = [14,70,53,83,49,91,36,80,92,51,66,70]
Output: 127

Constraints: