leetcode 189. Rotate Array

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]

.

Note:

Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.

class Solution {
public:
void rotate(vector<int>& nums, int k) {
if (nums.size()<2)
return;
if ( k <= 0)
return;
k = k%nums.size();
vector<int>aa = vector<int>(nums.begin(), nums.end()-k);
for (int i = nums.size() - 1;i>=nums.size() -k; i--)
aa.insert(aa.begin(),nums[i]);
nums = aa;
}
};

accept