leet_code_solutions/189_medium_[sense]_rotate_array.py at master · voidsatisfaction/leet_code_solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
from typing import List

class Solution:
    def rotate(self, nums: List[int], k: int) -> None:
        k = k % len(nums)
        if k == 0:
            return

        self._reverse(nums, 0, len(nums)-1)
        self._reverse(nums, 0, k-1)
        self._reverse(nums, k, len(nums)-1)

    def _reverse(self, nums: List[int], start: int, end: int) -> None:
        while start < end:
            self._swap(nums, start, end)

            start += 1
            end -= 1

    def _swap(self, nums: List[int], i: int, j: int) -> None:
        nums[i], nums[j] = nums[j], nums[i]


if __name__ == '__main__':
    s = Solution()

    nums = [1]
    s.rotate(nums, 100)
    assert nums == [1]

    nums = [1,3]
    s.rotate(nums, 0)
    assert nums == [1,3]

    nums = [1,2,3]
    s.rotate(nums, 2)
    assert nums == [2,3,1]

    nums = [1,2,3,4,5,6,7]
    s.rotate(nums, 3)
    assert nums == [5,6,7,1,2,3,4]

    nums = [-1,-100,3,99]
    s.rotate(nums, 2)
    assert nums == [3,99,-1,-100]