| | 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.AlternatingGroups2; |
| | 13 | |
|
| | 14 | | /// <inheritdoc /> |
| | 15 | | public class AlternatingGroups2SlidingWindow : IAlternatingGroups2 |
| | 16 | | { |
| | 17 | | /// <summary> |
| | 18 | | /// Time complexity - O(n + k) |
| | 19 | | /// Space complexity - O(1) |
| | 20 | | /// </summary> |
| | 21 | | /// <param name="colors"></param> |
| | 22 | | /// <param name="k"></param> |
| | 23 | | /// <returns></returns> |
| | 24 | | public int NumberOfAlternatingGroups(int[] colors, int k) |
| 3 | 25 | | { |
| 3 | 26 | | var count = 1; |
| 3 | 27 | | var result = 0; |
| | 28 | |
|
| 52 | 29 | | for (var i = 0; i < colors.Length - 1 + k - 1; i++) |
| 23 | 30 | | { |
| 23 | 31 | | if (colors[i % colors.Length] != colors[(i + 1) % colors.Length]) |
| 17 | 32 | | { |
| 17 | 33 | | count++; |
| 17 | 34 | | } |
| | 35 | |
|
| | 36 | | else |
| 6 | 37 | | { |
| 6 | 38 | | count = 1; |
| 6 | 39 | | } |
| | 40 | |
|
| 23 | 41 | | if (count >= k) |
| 5 | 42 | | { |
| 5 | 43 | | result++; |
| 5 | 44 | | } |
| 23 | 45 | | } |
| | 46 | |
|
| 3 | 47 | | return result; |
| 3 | 48 | | } |
| | 49 | | } |