Leetcdoe Rotate Array Python 如何旋转(移动)数组,如何用取余表示循环后的元素

Leetcode 189题 Rotate Array
Given an array, rotate the array to the right by k steps, where k is non-negative.

Follow up:

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?

Example 1:

Input: nums = [1,2,3,4,5,6,7], 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: nums = [-1,-100,3,99], 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]
 

Constraints:

1 <= nums.length <= 2 * 10^4
It's guaranteed that nums[i] fits in a 32 bit-signed integer.
k >= 0

---

题目大意：在数组nums中，旋转k步。一开始，不知道什么叫旋转数组。 其实就是往右依次移动k步，末尾溢出的数值补全到开头。还说了让用尽可能多的方法。想明白这个就好说了。

思路一
直接切片粘贴法：

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

这里 nums[:] = nums 非常重要，先开辟两个空间，为后面裁切后粘贴到哪做准备。

思路二
创建新数组，循环复制。

class Solution:
    def rotate(self, nums: List[int], k: int) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        old_nums = nums[:]
        length = len(nums)
        for i in range(length):
            nums[(i+k) % length] = old_nums[i]

这里用（i + k） 取余 length , 是当（i+k）小于nums长度时，取它本身， （i+k）大于nums长度时，循环回来，回到第一个位置。

疫情中的英国，
听说解除lock down还要很久，
加油！
10/05/2020