Solution (leetcode-in-java 1.21 API)

java.lang.Object
- g0401_0500.s0421_maximum_xor_of_two_numbers_in_an_array.Solution

```
public class Solution
extends Object
```
421 - Maximum XOR of Two Numbers in an Array.
Medium

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 = [14,70,53,83,49,91,36,80,92,51,66,70]

Output: 127

Constraints:
- 1 <= nums.length <= 2 * 10⁵
- 0 <= nums[i] <= 2³¹ - 1

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int findMaximumXOR(int[] nums)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

findMaximumXOR

public int findMaximumXOR(int[] nums)