| | | 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.MinimumNumberOfOperationsToMakeArrayXOREqualToK; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MinimumNumberOfOperationsToMakeArrayXOREqualToKIterativeString : |
| | | 16 | | IMinimumNumberOfOperationsToMakeArrayXOREqualToK |
| | | 17 | | { |
| | | 18 | | /// <summary> |
| | | 19 | | /// Time complexity - O(n) |
| | | 20 | | /// Space complexity - O(1) |
| | | 21 | | /// </summary> |
| | | 22 | | /// <param name="nums"></param> |
| | | 23 | | /// <param name="k"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public int MinOperations(int[] nums, int k) |
| | 2 | 26 | | { |
| | 10 | 27 | | var xor = nums.Aggregate(0, (current, num) => current ^ num); |
| | | 28 | | |
| | 2 | 29 | | if (xor == k) |
| | 1 | 30 | | { |
| | 1 | 31 | | return 0; |
| | | 32 | | } |
| | | 33 | | |
| | 1 | 34 | | var minOperations = 0; |
| | | 35 | | |
| | 1 | 36 | | var xorString = Convert.ToString(xor, 2); |
| | 1 | 37 | | var kString = Convert.ToString(k, 2); |
| | | 38 | | |
| | 1 | 39 | | var i = 0; |
| | | 40 | | |
| | 4 | 41 | | while (i < xorString.Length || i < kString.Length) |
| | 3 | 42 | | { |
| | 3 | 43 | | var xorChar = '0'; |
| | 3 | 44 | | var kChar = '0'; |
| | | 45 | | |
| | 3 | 46 | | if (i < xorString.Length) |
| | 3 | 47 | | { |
| | 3 | 48 | | xorChar = xorString[xorString.Length - 1 - i]; |
| | 3 | 49 | | } |
| | | 50 | | |
| | 3 | 51 | | if (i < kString.Length) |
| | 1 | 52 | | { |
| | 1 | 53 | | kChar = kString[kString.Length - 1 - i]; |
| | 1 | 54 | | } |
| | | 55 | | |
| | 3 | 56 | | if (xorChar != kChar) |
| | 2 | 57 | | { |
| | 2 | 58 | | minOperations++; |
| | 2 | 59 | | } |
| | | 60 | | |
| | 3 | 61 | | i++; |
| | 3 | 62 | | } |
| | | 63 | | |
| | 1 | 64 | | return minOperations; |
| | 2 | 65 | | } |
| | | 66 | | } |