class Solution {
public:
void reverse(vector<int> &nums,int i,int j)
{
int l=i,r=j;
while(l<=r)
{
swap(nums[l],nums[r]);
l++,r--;
}
}
void rotate(vector<int>& nums, int k) {
int n=nums.size();
if(k>nums.size())
{
k%=n;
}
reverse(nums,0,n-1);
reverse(nums,0,k-1);
reverse(nums,k,n-1);
}
};