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?
题意是将序列首尾相连,然后向右滚动k步。
解法1:把数组逆序,然后逆序前k % length个,再逆序剩下的即可。
Source1
public class Solution {
public void rotate(int[] nums, int k) {
if(k <= 0) return ;
reverse(0, nums.length - 1, nums);
reverse(0, k % nums.length - 1, nums);
reverse(k % nums.length, nums.length - 1, nums);
}
public void reverse(int start, int end, int[] nums){
while(start < end){
int temp = nums[end];
nums[end] = nums[start];
nums[start] = temp;
start ++;
end --;
}
}
}
解法2:用anchor指向第0位,record=nums[anchor],然后anchor指向rotate k位后的位置即anchor = (anchor + k)%length,记此位置的值为temp,交换temp和record,这样就把第0位的元素摆在了最终它应当在的位置,此时record记录的是当前anchor所指的数值,即第0位摆放在此处前的原有数值,用于下次的摆放。随着anchor的移动,record指向的数不断的被摆到最终位置,直至交换length次为止。此处存在一个问题就是anchor=(anchor + k)%length可能在计算若干次后又指回0,比如n = 10,k = 5,anchor重新等于0时显然数列不是最终状态,即尚未交换length次。这时就要使anchor后移一次从第1位开始,直至交换length为止。那么anchor的这种起始位置的移动最多有多少次呢?(外围循环结束条件)比如极端情况n = 7,k = 7,每次anchor都回到原位置,所以外围循环控制到k次。
注:用do...while,由于初始anchor = i,如果用while或for第一次循环条件就不满足,直接跳过循环不执行。
Source2
public class Solution {
public void rotate(int[] nums, int k) {
int len = nums.length;
int cnt = 0;
for(int i = 0; i < k ; i++){
int anchor = i;
int record = nums[anchor];
do{
anchor = (anchor + k) % len;
int temp = nums[anchor];
nums[anchor] = record;
record = temp;
cnt++;
}while(anchor != i);
if(cnt == len) break;
}
}
}