题目:
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.
解释:我就写了 一种方法
代码:
class Solution(object):
def rotate(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: void Do not return anything, modify nums in-place instead.
"""
k = k % len(nums)#判断k是否大于nums的长度
nums[:k], nums[k:] = nums[len(nums)-k:], nums[:len(nums)-k]
return nums
a = Solution()
print a.rotate([1,2,3,4,5,6,7],3)