189. Rotate Array.md

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        vector<int> ret(nums);
        int n = nums.size();
        for (int i = 0; i < n; ++i) {
            ret[(i + k) % n] = nums[i];
        }
        nums = ret;
    }
};

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