Rotate an array of n elements to the right by k steps.
For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].
class Solution {
public:
void reverse(vector<int>&nums, int l, int r)
{
while(l < r)
{
swap(nums[l++], nums[r--]);
}
}
void rotate(vector<int>& nums, int k)
{
int n = nums.size();
if(k > n)
{
k = k % n;
}
n -= 1;
reverse(nums, 0, n);
reverse(nums, 0, k-1);
reverse(nums, k, n);
}
};