代码链接:https://leetcode.cn/problems/rotate-array/solution/lai-zi-bei-da-suan-fa-ke-de-leetcodeti-j-lqfw/
三次反转法:
- 首先,数组整体反转一遍
- 然后,前k个数反转一遍
- 最后,k之后的数再反转一遍
注意python的reversed()会生成新的数组,就不算修改引用,因此leetcode中结果还是原数组。
1 2 3 4 | 5 6 7 (k=3) 原始
7 6 5 | 4 3 2 1 整体反转
5 6 7 | 1 2 3 4 左右分别反转
class Solution:
def rotate(self, nums: List[int], k: int) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
n = len(nums)
k %= n
if k==0: return
def reverse(nums, start, end):
while start < end:
nums[start], nums[end] = nums[end], nums[start]
start += 1
end -= 1
reverse(nums, 0, n-1)
reverse(nums, 0, k-1)
reverse(nums, k, n-1)