LC* 189. 轮转数组

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