LeetCode 189. 轮转数组

方法1：额外数组

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

方法2：额外vector

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n = nums.size();
        vector<int> temp(n);
        for(int i = 0; i < n; ++i){
            temp[(i + k) % n] = nums[i];    //相比方法1简单但是计算时间慢一点
        }
        nums.assign(temp.begin(), temp.end());    //直接调用数组赋值函数assign()
    }
};

方法3：数组反转(内置函数)

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n = nums.size();
        k %= n;
        reverse(nums.begin(),nums.begin() + n - k);    //直接调用反转函数reverse()
        reverse(nums.end() - k,nums.end());
        reverse(nums.begin(),nums.end());
    }
};

方法4：数组反转(手写函数)

class Solution {
public:
    void reverse(vector<int>& nums, int i, int j){
        while(i < j){
            swap(nums[i++], nums[j--]);
        }
    }

    void rotate(vector<int>& nums, int k) {
        int n = nums.size();
        k %= n;
        reverse(nums, 0, n - k - 1);
        reverse(nums, n - k, n - 1);
        reverse(nums, 0, n - 1);
    }
};