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) {
int len=nums.length;
k%=len;
int[] temp=new int[len];
for(int i=0;i<len;++i){
temp[(i+k)%len]=nums[i];
}
for(int i=0;i<len;++i){
nums[i]=temp[i];
}
return;
}
}