| | 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.XORQueriesOfSubarray; |
| | 13 | |
|
| | 14 | | /// <inheritdoc /> |
| | 15 | | public class XORQueriesOfSubarrayPrefixArray : IXORQueriesOfSubarray |
| | 16 | | { |
| | 17 | | /// <summary> |
| | 18 | | /// Time complexity - O(m + n) |
| | 19 | | /// Space complexity - O(n) |
| | 20 | | /// </summary> |
| | 21 | | /// <param name="arr"></param> |
| | 22 | | /// <param name="queries"></param> |
| | 23 | | /// <returns></returns> |
| | 24 | | public int[] XorQueries(int[] arr, int[][] queries) |
| 4 | 25 | | { |
| 4 | 26 | | var prefixArray = new int[arr.Length + 1]; |
| | 27 | |
|
| 36 | 28 | | for (var i = 0; i < arr.Length; i++) |
| 14 | 29 | | { |
| 14 | 30 | | prefixArray[i + 1] = prefixArray[i] ^ arr[i]; |
| 14 | 31 | | } |
| | 32 | |
|
| 4 | 33 | | var result = new int[queries.Length]; |
| | 34 | |
|
| 34 | 35 | | for (var i = 0; i < queries.Length; i++) |
| 13 | 36 | | { |
| 13 | 37 | | result[i] = prefixArray[queries[i][1] + 1] ^ prefixArray[queries[i][0]]; |
| 13 | 38 | | } |
| | 39 | |
|
| 4 | 40 | | return result; |
| 4 | 41 | | } |
| | 42 | | } |