mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
26 lines
748 B
HTML
26 lines
748 B
HTML
<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> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [3,10,5,25,2,8]
|
|
<strong>Output:</strong> 28
|
|
<strong>Explanation:</strong> The maximum result is 5 XOR 25 = 28.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [14,70,53,83,49,91,36,80,92,51,66,70]
|
|
<strong>Output:</strong> 127
|
|
</pre>
|
|
|
|
<p> </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>
|