189. 旋转数组
直接法
class Solution:
def rotate(self, nums: List[int], k: int) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
while k > 0:
num = nums.pop()
nums.insert(0, num)
k -= 1
简单方法
class Solution:
def rotate(self, nums: List[int], k: int) -> None:
K = k % len(nums)#针对k大于len(nums)的情况
nums[:]=nums[-K:]+nums[:-K]