Rotate Array

方法一:直接开个100010的数组水过。

方法二:编程之美上O(1)的额外空间开销

void reserve(int nums[],int n,int k)
{
    int temp;
    for(int i = k ; i < (n+k)/2 ; i++) {
        temp = nums[i];
        nums[i] = nums[n-i-1+k];
        nums[n-i-1+k] = temp;
    }
}
void rotate(int nums[], int n, int k) {
    k = k%n;
    reserve(nums,n-k,0);
    reserve(nums,n,n-k);
    reserve(nums,n,0);
}
原文地址:https://www.cnblogs.com/llei1573/p/4311904.html