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].
Solution:
public class Solution {
public void rotate(int[] nums, int k) {
k = k%nums.length;
reverse(nums, 0, nums.length-k-1);
reverse(nums, nums.length-k, nums.length-1);
reverse(nums, 0, nums.length-1);
}
public void reverse(int[] nums, int l, int r){
while(l<r){
int tmp = nums[l];
nums[l++] = nums[r];
nums[r--] = tmp;
}
}
}