| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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.TransformArrayToAllEqualElements; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class TransformArrayToAllEqualElementsGreedy : ITransformArrayToAllEqualElements |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <param name="k"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public bool CanMakeEqual(int[] nums, int k) |
| | 3 | 25 | | { |
| | 3 | 26 | | if (nums.Length <= 1) |
| | 0 | 27 | | { |
| | 0 | 28 | | return true; |
| | | 29 | | } |
| | | 30 | | |
| | 3 | 31 | | var previous1 = nums[0] == 1 ? 0 : 1; |
| | 3 | 32 | | var previous2 = nums[0] == -1 ? 0 : 1; |
| | | 33 | | |
| | 3 | 34 | | var count1 = previous1; |
| | 3 | 35 | | var count2 = previous2; |
| | | 36 | | |
| | 22 | 37 | | for (var i = 1; i < nums.Length - 1; i++) |
| | 8 | 38 | | { |
| | 8 | 39 | | var num = nums[i]; |
| | | 40 | | |
| | 8 | 41 | | var b1 = num == 1 ? 0 : 1; |
| | 8 | 42 | | var current1 = b1 ^ previous1; |
| | | 43 | | |
| | 8 | 44 | | previous1 = current1; |
| | 8 | 45 | | count1 += current1; |
| | | 46 | | |
| | 8 | 47 | | var b2 = num == -1 ? 0 : 1; |
| | 8 | 48 | | var current2 = b2 ^ previous2; |
| | | 49 | | |
| | 8 | 50 | | previous2 = current2; |
| | 8 | 51 | | count2 += current2; |
| | | 52 | | |
| | 8 | 53 | | if (count1 > k && count2 > k) |
| | 0 | 54 | | { |
| | 0 | 55 | | return false; |
| | | 56 | | } |
| | 8 | 57 | | } |
| | | 58 | | |
| | 3 | 59 | | var lastB1 = nums[^1] == 1 ? 0 : 1; |
| | 3 | 60 | | var ok1 = (lastB1 ^ previous1) == 0 && count1 <= k; |
| | | 61 | | |
| | 3 | 62 | | var lastB2 = nums[^1] == -1 ? 0 : 1; |
| | 3 | 63 | | var ok2 = (lastB2 ^ previous2) == 0 && count2 <= k; |
| | | 64 | | |
| | 3 | 65 | | return ok1 || ok2; |
| | 3 | 66 | | } |
| | | 67 | | } |