Package g2301_2400.s2317_maximum_xor_after_operations

Class Solution

java.lang.Object
g2301_2400.s2317_maximum_xor_after_operations.Solution
public class Solution extends Object
2317 - Maximum XOR After Operations.<p>Medium</p> <p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>. In one operation, select <strong>any</strong> non-negative integer <code>x</code> and an index <code>i</code>, then <strong>update</strong> <code>nums[i]</code> to be equal to <code>nums[i] AND (nums[i] XOR x)</code>.</p> <p>Note that <code>AND</code> is the bitwise AND operation and <code>XOR</code> is the bitwise XOR operation.</p> <p>Return <em>the <strong>maximum</strong> possible bitwise XOR of all elements of</em> <code>nums</code> <em>after applying the operation <strong>any number</strong> of times</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [3,2,4,6]</p> <p><strong>Output:</strong> 7</p> <p><strong>Explanation:</strong> Apply the operation with x = 4 and i = 3, num[3] = 6 AND (6 XOR 4) = 6 AND 2 = 2.</p> <p>Now, nums = [3, 2, 4, 2] and the bitwise XOR of all the elements = 3 XOR 2 XOR 4 XOR 2 = 7.</p> <p>It can be shown that 7 is the maximum possible bitwise XOR.</p> <p>Note that other operations may be used to achieve a bitwise XOR of 7.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,2,3,9,2]</p> <p><strong>Output:</strong> 11</p> <p><strong>Explanation:</strong> Apply the operation zero times.</p> <p>The bitwise XOR of all the elements = 1 XOR 2 XOR 3 XOR 9 XOR 2 = 11.</p> <p>It can be shown that 11 is the maximum possible bitwise XOR.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10<sup>5</sup></code></li> <li><code>0 <= nums[i] <= 10<sup>8</sup></code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • maximumXOR

      public int maximumXOR(int[] nums)