题目:
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(int nums[], int n, int k) {
k%=n;
int *r=new int[k];
for(int i=0;i<k;i++){
r[i]=nums[i+n-k];
}
for(int i=n-1;i>k-1;i--){
nums[i]=nums[i-k];
}
for(int i=0;i<k;i++){
nums[i]=r[i];
}
}
};