Leetcode--189. 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.
旋转数组

思路

解法有多种，这里总结两种方法
1、申请额外的内存空间，使用memcpy直接拷贝到目的空间去，时间复杂度为O(1)，控件复杂度为O(n)；
2、数组中的元素进行翻转即可，先翻转前半部分，再翻转后半部分，最后整体翻转。时间复杂度O(n)，控件复杂的O(1)

代码

解法1：

void rotate(int nums[], int n, int k) {
    k = k % n;
    if (k == 0) return;
    int *temp = new int[n];
    memcpy(temp, nums+(n-k), sizeof(int)*k);
    memcpy(temp+k, nums, sizeof(int)*(n-k));
    memcpy(nums, temp, sizeof(int)*n);
    delete[] temp;
}

解法2

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