Rotate an array of n elements to the right by k steps.
For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].
Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
题意:元素右移k位
首先k%n得到实际右移的步数
方法一:创建新数组,每个元素i右移至(i+k)%n,但空间复杂度为O(n)
方法二:末尾取k个元素拼接到数组最前端
Runtime: 102 ms
方法三:先把前n-k个数字翻转一下,再把后k个数字翻转一下,最后再把整个数组翻转一下
Runtime: 85 ms
由于题目要求不返回任何值,修改原始列表,因此不能直接将新生成的结果赋值给nums,这样只是将变量指向新的列表,原列表并没有修改。
需要将新生成的结果赋予给nums[:],才能够修改原始列表
class Solution(object):
def rotate(self, nums, k):
n=len(nums)
if n<2 or k==0:
return
k=k%n
nums[:k],nums[k:]=nums[n-k:],nums[:n-k]
#nums[:]=nums[n-k:]+nums[:n-k] #效果等同于上一行
class Solution(object):
def rotate(self, nums, k):
n=len(nums)
if n<2 or k==0:
return
k=k%n
n1=nums[:n-k]
n1.reverse()
n2=nums[n-k:]
n2.reverse()
nums[:]=list(n1+n2)
nums.reverse()