| | | 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.RotateArray; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class RotateArrayCycleReplacement : IRotateArray |
| | | 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 | | public void Rotate(int[] nums, int k) |
| | 5 | 24 | | { |
| | 5 | 25 | | var n = nums.Length; |
| | | 26 | | |
| | 5 | 27 | | k %= n; |
| | | 28 | | |
| | 5 | 29 | | if (k == 0) |
| | 3 | 30 | | { |
| | 3 | 31 | | return; |
| | | 32 | | } |
| | | 33 | | |
| | 2 | 34 | | var count = 0; |
| | | 35 | | |
| | 10 | 36 | | for (var index = 0; count < n; index++) |
| | 3 | 37 | | { |
| | 3 | 38 | | var currentIndex = index; |
| | 3 | 39 | | var previousValue = nums[index]; |
| | | 40 | | |
| | | 41 | | do |
| | 11 | 42 | | { |
| | 11 | 43 | | var nextIndex = (currentIndex + k) % n; |
| | | 44 | | |
| | 11 | 45 | | (nums[nextIndex], previousValue) = (previousValue, nums[nextIndex]); |
| | | 46 | | |
| | 11 | 47 | | currentIndex = nextIndex; |
| | | 48 | | |
| | 11 | 49 | | count++; |
| | 22 | 50 | | } while (currentIndex != index); |
| | 3 | 51 | | } |
| | 5 | 52 | | } |
| | | 53 | | } |