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.
用了空间度为O(n)的最简单的解法,不过也被accept了,晚些时候补上其他的两种方法。
class Solution {
public:
void rotate(int nums[], int n, int k) {
int *copy = new int[n];
memcpy(copy, nums, n * sizeof(int));
for (int i = 0; i < n; i++)
{
nums[(i + k) % n] = copy[i];
}
}
};