1
# Runtime: 484 ms (Top 40.41%) | Memory: 25.4 MB (Top 28.89%)
2
class Solution:
3
    def reverse(self, arr, left, right):
4
        while left < right:
5
            arr[left], arr[right] = arr[right], arr[left]
6
            left, right = left + 1, right - 1
7
        return arr
8

9
    def rotate(self, nums: List[int], k: int) -> None:
10
        length = len(nums)
11
        k = k % length
12
        l, r = 0, length - 1
13
        nums = self.reverse(nums, l, r)
14
        l, r = 0, k - 1
15
        nums = self.reverse(nums, l, r)
16
        l, r = k, length - 1
17
        nums = self.reverse(nums, l, r)
18
        return nums