Rotate Array K Times

rotate_array.cpp

/*
  Space complexity - O(1)   in-place
  Time Complexity - O(N)
*/

class Solution {  
  public:
    void rotate(vector<int>& nums, int k) {
        k = k - (k/nums.size())*nums.size();
        reverse(nums, 0,nums.size()-k-1);
        reverse(nums, nums.size()-k ,nums.size()-1);
        reverse(nums,0,nums.size()-1);
    }
    void reverse(vector<int>& nums, int low, int high)
    {
        while(low<high)
        {
            swap(nums[low],nums[high]);
            low++;
            high--;
        }
    }
};