Skip to content

Easy Code for Solution 2 in Question 1829.Maximum XOR for Each Query #4003

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed

piyushlasane wants to merge 2 commits into doocs:main from piyushlasane:patch-1

Closed

Easy Code for Solution 2 in Question 1829.Maximum XOR for Each Query #4003

Changes from all commits

Commits

Show all changes

Select commit Hold shift + click to select a range

Easy Code for Solution 2 in Question 1829.Maximum XOR for Each Query

piyushlasane Jan 30, 2025

style: format code and docs with prettier

piyushlasane Jan 30, 2025

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

20 changes: 8 additions & 12 deletions solution/1800-1899/1829.Maximum XOR for Each Query/README_EN.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -303,20 +303,16 @@ class Solution:
		```java
		class Solution {
		public int[] getMaximumXor(int[] nums, int maximumBit) {
	int xs = 0;
	for (int x : nums) {
	xs ^= x;
	int xor = (int)(Math.pow(2, maximumBit))-1;
	int[] answer = new int[nums.length];
	for(int i = 1; i < nums.length; i++){
	nums[i] ^= nums[i-1];
		}
	int mask = (1 << maximumBit) - 1;
	int n = nums.length;
	int[] ans = new int[n];
	for (int i = 0; i < n; ++i) {
	int x = nums[n - i - 1];
	int k = xs ^ mask;
	ans[i] = k;
	xs ^= x;
	int k=0;
	for(int i=nums.length-1; i>=0; i--){
	answer[k++] ^= nums[i]^xor;
		}
	return ans;
	return answer;
		}
		}
		```
Expand Down