leetCode---Rotate Array

一. 题目：Rotate Array 

Rotate an array of n elements to the right by k steps.
For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. 
Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem. 

二. 思路分析

题意：循环数组，n代表数组的长度，k代表向右移动的次数。

方法1：

方法1比较简单，就是要额外开辟n个空间，先拷贝一份数组。

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        if(nums.size() == 0 || k <= 0) return;
        vector<int> copynums(nums.size());
        for(int i = 0; i < nums.size(); i++){
            copynums[i] = nums[i];
        }
        for(int i = 0; i< nums.size(); i++){
            nums[(i + k)% nums.size()] = copynums[i];
        }
    }
};

方法2：三次翻转法，第一次翻转前n-k个，第二次翻转后k个，第三次翻转全部。

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        if (nums.empty() || (k %= nums.size()) == 0) return;
        int n = nums.size();
        reverse(nums.begin(), nums.begin() + n - k);
        reverse(nums.begin() + n - k, nums.end());
        reverse(nums.begin(), nums.end());
    }
};

方法3：

由于旋转数组的操作也可以看做从数组的末尾取k个数组放入数组的开头，所以我们用STL的push_back和erase可以很容易的实现这些操作。

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        if (nums.empty() || (k %= nums.size()) == 0) return;
        int n = nums.size();
        for (int i = 0; i < n - k; ++i) {
            nums.push_back(nums[0]);
            nums.erase(nums.begin());
        }
    }
};