LeetCode(189) Rotate Array(Java)

题目如下：

Rotate Array Total Accepted: 19161 Total Submissions: 108570 My Submissions Question Solution 
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].

分析如下：

需要注意的是，validate input， k可能会比nums.length更大。
我的代码：

/*
Runtime Error Message:	Line 5: java.lang.ArrayIndexOutOfBoundsException: 1
Last executed input:	[-1], 2 
Note: k might be larger num.length - 1.
225 ms
*/
public class Solution {
    void reverse(int[] nums, int start, int end) {
        while(start < end) {
            int temp = nums[start];
            nums[start] = nums[end];
            nums[end] = temp;
            ++start;
            --end;
        }
    }
    public void rotate(int[] nums, int k) {
        k = k % nums.length;
        reverse(nums, 0, nums.length - 1 );
        reverse(nums, 0, k - 1 );
        reverse(nums, k, nums.length - 1 );
    }
}