leetcode-master
leetcode-master copied to clipboard
189旋转数组左旋和右旋好像反了
例如Python解法,应该为
class Solution:
def rotate(self, nums: List[int], k: int) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
def reverse(i, j):
while i < j:
nums[i], nums[j] = nums[j], nums[i]
i += 1
j -= 1
n = len(nums)
k %= n
reverse(0, n-k-1)
reverse(n-k, n-1)
reverse(0, n-1)
才可以通过