比如:
输入: [1,2,3,4,5,6,7] 和 k = 3
输出: [5,6,7,1,2,3,4]
解释:
向右旋转 1 步: [7,1,2,3,4,5,6]
向右旋转 2 步: [6,7,1,2,3,4,5]
向右旋转 3 步: [5,6,7,1,2,3,4]
我们的思路是先逆置1234,得到 4321 567
总体逆置得到 765 1234
再逆置前面三个 得到567 1234
这道题有毒,有很大的坑
[1,2,3],右旋4次得到[3,1,2]
相当于右旋一次
网址:https://leetcode-cn.com/problems/rotate-array/submissions/
class Solution {
public void rotate(int[] nums, int k) {
int end = nums.length;
while(k >= end){
k = k - end;
}
reverse(nums,end - k);
reverse(nums,end);
reverse(nums,k);
}
public void reverse(int[] arr,int num){
int left = 0;
int right = num -1 ;
while (left < right){
int tmp = arr[left];
arr[left] = arr[right];
arr[right] = tmp;
left++;
right--;
}
}
}