public class Solution {
public void rotate(int[] nums, int k) {
k = k%nums.length;
if(nums.length==1|k==0){
return;
}
swap(nums,0,nums.length-1);
swap(nums,0,k-1);
swap(nums,k,nums.length-1);
}
//旋转数组内的a到b个元素
public void swap(int[] nums,int a,int b){
int temp = 0;
int first=a;
int end=b;
while(first<end){
temp = nums[first];
nums[first] = nums[end];
nums[end] = temp;
first++;
end--;
}
}
}
要注意边界条件,k>nums.length,或者k=0.