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].
用一个辅助数组来解决。
public class Solution {
public void rotate(int[] nums, int k) {
if(k>nums.length)
k=k%nums.length;
int[] a=new int[nums.length];
for(int i=0;i<k;i++)
a[i]=nums[nums.length-k+i];
for(int i=k;i<nums.length;i++)
a[i]=nums[i-k];
System.arraycopy(a, 0, nums, 0, nums.length);
}
}