189. Rotation array

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

    void reverse(vector<int>& nums, int begin, int end){
    
        while(begin < end){
    
            swap(nums[begin], nums[end]);
            begin++;
            end--;
        }
    }
};

Accepted
38/38 cases passed (36 ms)
Your runtime beats 7.9 % of cpp submissions
Your memory usage beats 98.48 % of cpp submissions (24.2 MB)