給定一個數組，向右旋轉陣列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