Leetcode_Array --189. Rotate Array [easy]

Given an array, rotate the array to the right by k steps, where k is non-negative.
给定一个数组，将数组向右扭转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]

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

Solutions：

Python
class Solution:
    def rotate(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        n = len(nums)
        nums[:] = nums[n-k:] + nums[:n-k]   #在原数组上修改，如果改成nums = nums[n-k:] + nums[:n-k]，则创建了新的空间

C++

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n = nums.size();
        while(k>0){   #只要k大于0，则保存nums中最后一个元素，然后将前一个元素赋值给后一个元素，最后再将temp存储的元素赋值为nums[0],完成一次向右扭转，k为几，就需要扭转几次
            int temp = nums[n-1];
            for (int i = n-1;i>0;i--){
                nums[i] = nums[i-1];
            }
            k--;
            nums[0] = temp;
        }
    }
};