189. 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.
旋转数组
思路：
使用一个反转函数。
第一步:反转整个数组[0,n-1]；
第二步：反转上一步得到数组的[0,k-1];
第二步：反转上一步得到数组的[k,n-1];

public class Solution {
    public void rotate(int[] nums, int k) {
        k %= nums.length;//确保k小于数组长度
        reverse(nums,0,nums.length-1);
        reverse(nums,0,k-1);
        reverse(nums,k,nums.length-1);}

    public void reverse(int[] nums , int i, int j){
        while(i<j){
            int temp = nums[i];
            nums[i] = nums[j];
            nums[j] = temp;
            i++;
            j--;
        }
        }       
       }