思路
看 k%len(nums)情况
k%len(nums)==0:翻转后还是原列表,那就不需要翻转
k%len(nums)>len(nums)//2,显然从后往前翻转过慢,不如从前往后翻转(次数更少)
k%len(nums)<=len(nums)//2,显然从后往前翻转次数更少(相等则翻转次数一样,从后翻也可)
是只能修改原列表,不然可以分割法 nums[len(nums)-k:len(nums)]+nums[0:len(nums)-k]
class Solution(object):
def rotate(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: None Do not return anything, modify nums in-place instead.
"""
k =k%len(nums)
if k==0:
return nums
if k>len(nums)//2:
for i in range(len(nums)-k):
nums.append(nums.pop(0))
else:
for i in range(k):
nums.insert(0,nums.pop())