| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.MaximumXORForEachQuery; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MaximumXORForEachQueryBitMasking : IMaximumXORForEachQuery |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <param name="maximumBit"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int[] GetMaximumXor(int[] nums, int maximumBit) |
| | 3 | 25 | | { |
| | 3 | 26 | | var result = new int[nums.Length]; |
| | | 27 | | |
| | 17 | 28 | | var xor = nums.Aggregate(0, (current, num) => current ^ num); |
| | | 29 | | |
| | 3 | 30 | | var mask = (1 << maximumBit) - 1; |
| | | 31 | | |
| | 34 | 32 | | for (var i = 0; i < nums.Length; i++) |
| | 14 | 33 | | { |
| | 14 | 34 | | result[i] = xor ^ mask; |
| | | 35 | | |
| | 14 | 36 | | xor ^= nums[nums.Length - 1 - i]; |
| | 14 | 37 | | } |
| | | 38 | | |
| | 3 | 39 | | return result; |
| | 3 | 40 | | } |
| | | 41 | | } |