189 Rotate Array

题目链接：https://leetcode.com/problems/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.

解题思路：
这题考点数组的运用。
这题在暑假面试的时候是卷子里的题，当时解法太幼稚了。。。
普通的做法就是创建一个辅助旋转的新数组，将数组旋转好后又放回原数组中。

好的做法（就地旋转，额外空间使用为 O(1)）是：
1. 将数组拆分为两部分，一部分是挪到数组前面的，另一部分是挪到数组后面的部分
2. 分别将两个部分各自的元素做逆置
3. 再对全部数组元素做逆置
举例：
1. Divide the array two parts: 1,2,3,4 and 5, 6
2. Rotate first part: 4,3,2,1,5,6
3. Rotate second part: 4,3,2,1,6,5
4. Rotate the whole array: 5,6,1,2,3,4

代码实现：

public class Solution {
    public void rotate(int[] nums, int k) {
        if(nums == null || nums.length == 0)
            return;
        k = k % nums.length;
        int firstLen = nums.length - k;
        reverse(nums, 0, firstLen - 1);
        reverse(nums, firstLen, nums.length - 1);
        reverse(nums, 0, nums.length - 1);
    }
    void reverse(int[] nums, int start, int end) {
        while(start < end) {
            int temp = nums[start];
            nums[start] = nums[end];
            nums[end] = temp;
            start ++;
            end --;
        }
    }
}

33 / 33 test cases passed.
Status: Accepted
Runtime: 1 ms