Leetcode 189 Rotate Array

题目

Given an array, rotate the array to the right by k steps, where k is non-negative.

Follow up:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
Could you do it in-place with O(1) extra space?

Example 1:
Input: nums = [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]
Explanation:
rotate 1 steps to the right: [7,1,2,3,4,5,6]
rotate 2 steps to the right: [6,7,1,2,3,4,5]
rotate 3 steps to the right: [5,6,7,1,2,3,4]

Example 2:
Input: nums = [-1,-100,3,99], k = 2
Output: [3,99,-1,-100]
Explanation:
rotate 1 steps to the right: [99,-1,-100,3]
rotate 2 steps to the right: [3,99,-1,-100]

Constraints:
1 <= nums.length <= 2 * 104
-2^31 <= nums[i] <= 2^31 - 1
0 <= k <= 105

思路

总的思路是把最后一个元素先存下来，依次把往前k个的元素往后放，最后把存下来的这个元素放到正确的位置上结束。
第一种，k和nums.length不互质的时候，如例二，此时每次轮回一圈的时候（即当前index和存下来的index一致），就可以把存的元素放到正确的位置上，一小圈完成；将index减小1，进行下一圈的旋转。同时如果j - k < 0超出数组边界，则再加上nums.length处理。
第二种是互质的时候，此时其实可以包含在1的代码中，因为一种它是当前index永远不等于储存index的情况。

代码

class Solution {
    public void rotate(int[] nums, int k) {
        if (nums == null || nums.length == 0 || k % nums.length == 0) return;
        
        k = k % nums.length;
        
        int count = 0;
        int index = nums.length - 1;
        int temp = nums[index];
        int j = nums.length - 1;
        
        while (true) {
            if (j - k >= 0) {
                nums[j] = nums[j - k];
                j -= k;
                count++;
            } else {
                nums[j] = nums[j - k + nums.length];
                j = j - k + nums.length;
                count++;
            }
            
            if (j == index) {
                nums[j + k - nums.length] = temp;
                j--;
                index = j;
                temp = nums[j];
            }
            if (count == nums.length - 1) {
                nums[j] = temp;
                break;
            }
        }
        
        return;
    }
}