Skip to content

Commit 07faefe

Browse files
authored
Easy Code for Solution 2 in Question 1829.Maximum XOR for Each Query
1 parent c461e7b commit 07faefe

File tree

1 file changed

+8
-12
lines changed
  • solution/1800-1899/1829.Maximum XOR for Each Query

1 file changed

+8
-12
lines changed

solution/1800-1899/1829.Maximum XOR for Each Query/README_EN.md

Lines changed: 8 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -303,20 +303,16 @@ class Solution:
303303
```java
304304
class Solution {
305305
public int[] getMaximumXor(int[] nums, int maximumBit) {
306-
int xs = 0;
307-
for (int x : nums) {
308-
xs ^= x;
306+
int xor = (int)(Math.pow(2, maximumBit))-1;
307+
int[] answer = new int[nums.length];
308+
for(int i = 1; i < nums.length; i++){
309+
nums[i] ^= nums[i-1];
309310
}
310-
int mask = (1 << maximumBit) - 1;
311-
int n = nums.length;
312-
int[] ans = new int[n];
313-
for (int i = 0; i < n; ++i) {
314-
int x = nums[n - i - 1];
315-
int k = xs ^ mask;
316-
ans[i] = k;
317-
xs ^= x;
311+
int k=0;
312+
for(int i=nums.length-1; i>=0; i--){
313+
answer[k++] ^= nums[i]^xor;
318314
}
319-
return ans;
315+
return answer;
320316
}
321317
}
322318
```

0 commit comments

Comments
 (0)