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.
Hint:
Could you do it in-place with O(1) extra space?
Could you do it in-place with O(1) extra space?
Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.
思路:两次遍历,第一次先整体rotate,第二次再前k个rotate,后n-k个rotate
时间复杂度O(n), 空间复杂度O(1)
代码:
class Solution {
public:
void rotate(int nums[], int n, int k) {
if(nums == NULL || n < 1 || k < 1)return;
k = k % n;
for(int i = 0, j = n - 1; i < j; ++i, --j){
swap(nums[i], nums[j]);
}
for(int i = 0, j = k - 1; i < j; ++i, --j){
swap(nums[i], nums[j]);
}
for(int i = k, j = n - 1; i < j; ++i, --j){
swap(nums[i], nums[j]);
}
}
};