| | | 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.MinimumRecolorsToGetKConsecutiveBlackBlocks; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MinimumRecolorsToGetKConsecutiveBlackBlocksSlidingWindow : IMinimumRecolorsToGetKConsecutiveBlackBlocks |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="blocks"></param> |
| | | 22 | | /// <param name="k"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int MinimumRecolors(string blocks, int k) |
| | 3 | 25 | | { |
| | 3 | 26 | | var blackCount = 0; |
| | | 27 | | |
| | 36 | 28 | | for (var i = 0; i < k; i++) |
| | 15 | 29 | | { |
| | 15 | 30 | | if (blocks[i] == 'B') |
| | 8 | 31 | | { |
| | 8 | 32 | | blackCount++; |
| | 8 | 33 | | } |
| | 15 | 34 | | } |
| | | 35 | | |
| | 3 | 36 | | var minimumRecolors = k - blackCount; |
| | | 37 | | |
| | 16 | 38 | | for (var i = k; i < blocks.Length; i++) |
| | 6 | 39 | | { |
| | 6 | 40 | | if (blocks[i] == 'B') |
| | 3 | 41 | | { |
| | 3 | 42 | | blackCount++; |
| | 3 | 43 | | } |
| | | 44 | | |
| | 6 | 45 | | if (blocks[i - k] == 'B') |
| | 3 | 46 | | { |
| | 3 | 47 | | blackCount--; |
| | 3 | 48 | | } |
| | | 49 | | |
| | 6 | 50 | | minimumRecolors = Math.Min(minimumRecolors, k - blackCount); |
| | | 51 | | |
| | 6 | 52 | | if (minimumRecolors == 0) |
| | 1 | 53 | | { |
| | 1 | 54 | | return 0; |
| | | 55 | | } |
| | 5 | 56 | | } |
| | | 57 | | |
| | 2 | 58 | | return minimumRecolors; |
| | 3 | 59 | | } |
| | | 60 | | } |