Maximum XOR for Each Query LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<int> getMaximumXor(vector<int> &nums, int maximumBit) {
4
    int n = nums.size();
5
    vector<int> arr(n, 0);
6
    arr[0] = nums[0];
7
    for (int i = 1; i < n; i++) {
8
      arr[i] = arr[i - 1] ^ nums[i];
9
    }
10
    int idx = 0;
11
    int k = (1 << maximumBit) - 1;
12

13
    for (int i = n - 1; i >= 0; i--) {
14
      int curr = k & ~(arr[i]); // invertBits(arr[i]);
15
      nums[idx++] = curr;
16
    }
17
    return nums;
18
  }
19
};