原题连接:点击打开链接
题目:
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]
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.
"""
if k>0 and k<len(nums):
l_get = nums[len(nums)-k:len(nums)]
l_front = nums[0:len(nums)-k]
for i in range(0,len(l_front)):
l_get.append(l_front[i])
for j in range(0,len(nums)):
nums[j] = l_get[j]
elif k > len(nums):
k = k % len(nums)
l_get = nums[len(nums)-k:len(nums)]
l_front = nums[0:len(nums)-k]
for i in range(0,len(l_front)):
l_get.append(l_front[i])
for j in range(0,len(nums)):
nums[j] = l_get[j]
else:
pass