给定一个数组,向右旋转数组k步,k非负
Example 1:
Input:[1,2,3,4,5,6,7]
and k = 3 Output:[5,6,7,1,2,3,4]
Explanation: rotate 1 steps to the right:[7,1,2,3,4,5,6]
rotate 2 steps to the right:[6,7,1,2,3,4,5]
rotate 3 steps to the right:[5,6,7,1,2,3,4]
Example 2:
Input:[-1,-100,3,99]
and k = 2 Output: [3,99,-1,-100] Explanation: rotate 1 steps to the right: [99,-1,-100,3] rotate 2 steps to the right: [3,99,-1,-100]
注意:
尝试用尽可能多的方法来解决该题,本题至少有三种解法
要求使用O(1)的空间复杂度解决该题
1:需要移动的区域整体移动(移动区域大小为k%len(nums))
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)
rotatePart = nums[len(nums)-k:]
nums[k:] = nums[:len(nums)-k]
nums[:k] = rotatePart
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)
nums[:]=nums[-k:]+nums[:-k]
2:一个数字一个数字的移动,时间复杂度O(n)(错误:超出时间限制)
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)
for i in range(k):
tailSum = nums[-1]
for j in range(len(nums)-1,0,-1):
nums[j] = nums[j-1]
nums[0] = tailSum
算法题来自:https://leetcode-cn.com/problems/rotate-array/description/