【LeetCode热题100】【普通数组】轮转数组

class Solution {
public:
    void rotate(vector<int> &nums, int k) {
        auto reverse = [](vector<int> &nums, int begin, int end) -> void {
            while (begin < end) {
                swap(nums[begin++], nums[end--]);
            }
        };
        k = k % nums.size();
        reverse(nums, 0, nums.size() - 1);
        reverse(nums, 0, k - 1);
        reverse(nums, k, nums.size() - 1);
    }
};