非一次ac

class Solution {
public:
    void rotate(int nums[], int n, int k) {
        k %= n;
        k = n - k; //这一句不要忘了..
        int left = 0, right = k - 1;
        //while循环里也很容易忘记更新指针的值。。
        while(left < right){
            int tmp = nums[left];
            nums[left] = nums[right];
            nums[right] = tmp;
            left++;
            right--;
        }
        left = k, right = n - 1;
        while(left < right){
            int tmp = nums[left];
            nums[left] = nums[right];
            nums[right] = tmp;
            left++;
            right--;
        }
        left = 0; right = n - 1;
        while(left < right){
            int tmp = nums[left];
            nums[left] = nums[right];
            nums[right] = tmp;
            left++;
            right--;
        }
        return;
    }
};