189. Rotate Array python

Given an array, rotate the array to the right by k steps, where k is non-negative.

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]

Note:

• Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
• Could you do it in-place with O(1) extra space?

题意：k的后面的位置转移到前面

思路：首先把0：length-k翻转，然后把lengh-k：length翻转得到[4,3,2,1,7,6,5]，然后整个翻转

class Solution:
    def rotate(self, nums: List[int], k: int) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        length=len(nums)
        m=length-k
        nums[0:m]=reversed(nums[0:m])
        nums[m:length]=reversed(nums[m:length])
        
        nums=list(reversed(nums))
        
        

python3里面，reversed返回的是一个对象，需要加list转换成liist。或者使用nums[0:length]=reversed(nums[0:nums])

python2里面，必须使用nums[0:length]=reversed(nums[0:length])，通过reversed不行