Re-solve "Rotate Array"

src/rotate_array.py

@@ -1,14 +1,18 @@
-def reverse(nums: list[int], left: int, right: int) -> None:
-    while left < right:
-        nums[left], nums[right] = nums[right], nums[left]
-        left += 1
-        right -= 1
+def reverse(start: int, end: int, array: list[int]) -> None:
+    n = end - start
+
+    for i in range(n // 2):
+        left = start + i
+        right = end - i - 1
+
+        array[left], array[right] = array[right], array[left]
 
 
 class Solution:
     def rotate(self, nums: list[int], k: int) -> None:
-        """Mutates in place."""
-        k %= len(nums)
-        reverse(nums, 0, len(nums) - 1)
-        reverse(nums, 0, k - 1)
-        reverse(nums, k, len(nums) - 1)
+        n = len(nums)
+        k = k % n
+
+        reverse(0, n - k, nums)
+        reverse(n - k, n, nums)
+        reverse(0, n, nums)

tests/test_rotate_array.py

@@ -8,6 +8,7 @@
     [
         ([1, 2, 3, 4, 5, 6, 7], 3, [5, 6, 7, 1, 2, 3, 4]),
         ([-1, -100, 3, 99], 2, [3, 99, -1, -100]),
+        ([1, 2, 3, 4, 5, 6], 11, [2, 3, 4, 5, 6, 1]),
     ],
 )
 def test_solution(nums, k, expected):