Rotate Array

/*
Logic:
  reverse the last k elements
  reverse the remaining elements
  revese the whole array now
*/

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