Class Solution
java.lang.Object
g0401_0500.s0421_maximum_xor_of_two_numbers_in_an_array.Solution
421 - Maximum XOR of Two Numbers in an Array.<p>Medium</p>
<p>Given an integer array <code>nums</code>, return <em>the maximum result of</em> <code>nums[i] XOR nums[j]</code>, where <code>0 <= i <= j < n</code>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums = [3,10,5,25,2,8]</p>
<p><strong>Output:</strong> 28</p>
<p><strong>Explanation:</strong> The maximum result is 5 XOR 25 = 28.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums = [14,70,53,83,49,91,36,80,92,51,66,70]</p>
<p><strong>Output:</strong> 127</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= nums.length <= 2 * 10<sup>5</sup></code></li>
<li><code>0 <= nums[i] <= 2<sup>31</sup> - 1</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
findMaximumXOR
public int findMaximumXOR(int[] nums)
-