| | | 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.FindThePowerOfKSizeSubarrays1; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class FindThePowerOfKSizeSubarrays1ConsecutiveCount : IFindThePowerOfKSizeSubarrays1 |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <param name="k"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int[] ResultsArray(int[] nums, int k) |
| | 3 | 25 | | { |
| | 3 | 26 | | if (k == 1) |
| | 0 | 27 | | { |
| | 0 | 28 | | return nums; |
| | | 29 | | } |
| | | 30 | | |
| | 3 | 31 | | var result = new int[nums.Length - k + 1]; |
| | | 32 | | |
| | 3 | 33 | | Array.Fill(result, -1); |
| | | 34 | | |
| | 3 | 35 | | var consecutiveCount = 1; |
| | | 36 | | |
| | 36 | 37 | | for (var i = 0; i < nums.Length - 1; i++) |
| | 15 | 38 | | { |
| | 15 | 39 | | if (nums[i] + 1 == nums[i + 1]) |
| | 5 | 40 | | { |
| | 5 | 41 | | consecutiveCount++; |
| | 5 | 42 | | } |
| | | 43 | | else |
| | 10 | 44 | | { |
| | 10 | 45 | | consecutiveCount = 1; |
| | 10 | 46 | | } |
| | | 47 | | |
| | 15 | 48 | | if (consecutiveCount >= k) |
| | 4 | 49 | | { |
| | 4 | 50 | | result[i - k + 2] = nums[i + 1]; |
| | 4 | 51 | | } |
| | 15 | 52 | | } |
| | | 53 | | |
| | 3 | 54 | | return result; |
| | 3 | 55 | | } |
| | | 56 | | } |