原题链接:https://leetcode.com/problems/rotate-array/description/
思路分析:将一个数组右旋转k位,将最后的结果和最初的数组对比,找出坐标对应关系,替换元素即可
Time Complexity:O(n)
Space Complexity:O(k)
题解:
length = len(nums)
k = k % length
if not k:
return
tmp_array =[item for item in nums[length-k:]]
for i in range(length-k-1, -1, -1):
nums[i+k] = nums[i]
nums[:k] = tmp_array