LeetCode 189. 旋转数组

示例 1:

输入: [1,2,3,4,5,6,7] 和 k = 3
输出: [5,6,7,1,2,3,4]
解释:
向右旋转 1 步: [7,1,2,3,4,5,6]
向右旋转 2 步: [6,7,1,2,3,4,5]
向右旋转 3 步: [5,6,7,1,2,3,4]
示例 2:

输入: [-1,-100,3,99] 和 k = 2
输出: [3,99,-1,-100]
解释: 
向右旋转 1 步: [99,-1,-100,3]
向右旋转 2 步: [3,99,-1,-100]

class Solution:
    def rotate(self, nums: [int], k: int) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        # #数组段切换
        # lenN = len(nums)
        # k = k % len(nums)#防止超界
        # nums[:k], nums[k:] = nums[lenN-k:], nums[:lenN-k]
        #颠倒数组
        nums.reverse()
        for i in range(0,k):
            nums.append(nums.pop(0))
        nums.reverse()