| | | 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.FindAllKDistantIndicesInAnArray; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class FindAllKDistantIndicesInAnArrayTwoPointers : IFindAllKDistantIndicesInAnArray |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <param name="key"></param> |
| | | 23 | | /// <param name="k"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public IList<int> FindKDistantIndices(int[] nums, int key, int k) |
| | 2 | 26 | | { |
| | 2 | 27 | | var result = new List<int>(); |
| | | 28 | | |
| | 2 | 29 | | var right = 0; |
| | | 30 | | |
| | 28 | 31 | | for (var j = 0; j < nums.Length; j++) |
| | 12 | 32 | | { |
| | 12 | 33 | | if (nums[j] != key) |
| | 5 | 34 | | { |
| | 5 | 35 | | continue; |
| | | 36 | | } |
| | | 37 | | |
| | 7 | 38 | | var left = Math.Max(right, j - k); |
| | | 39 | | |
| | 7 | 40 | | right = Math.Min(nums.Length - 1, j + k) + 1; |
| | | 41 | | |
| | 36 | 42 | | for (var i = left; i < right; i++) |
| | 11 | 43 | | { |
| | 11 | 44 | | result.Add(i); |
| | 11 | 45 | | } |
| | 7 | 46 | | } |
| | | 47 | | |
| | 2 | 48 | | return result; |
| | 2 | 49 | | } |
| | | 50 | | } |