[leetCode] Rotate Array

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]. 

Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.

[show hint]

Hint:
Could you do it in-place with O(1) extra space?

Related problem: Reverse Words in a String II

Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.

public class Solution {
    public void reverse(int[] nums, int l, int r){
        for (int i = 0; i <= (r-l)/2 && r >= l; i++) {
            int tmp = nums[l + i];
            nums[l + i] = nums[r - i];
            nums[r - i] = tmp;
        }
    }

    public void rotate(int[] nums, int k) {
        if (nums.length < 2) return;
        reverse(nums, 0, nums.length - 1);
        reverse(nums, 0, k%nums.length-1);
        reverse(nums, k%nums.length, nums.length - 1);
    }
}