LeetCode-189：Rotate Array (数组的循环移位)

Question

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.

Idea

将一个含有n个元素的数组，旋转k步，即将右边的k个元素，从数组尾部依次移动到数组的头部。

1. idea1：利用分步的思想，定义一个反转数组的函数，进行三次反转，进而得到目标数组。
   
   • 首先进行原数组的整体反转；
   • 将反转后的数组的当前k个元素进行反转；
   • 再将后n-k个元素进行反转.

Code

idea1—Java

public class Solution {
    public void rotate(int[] nums, int k) {
        int n = nums.length;
        k = k%n;
        reverse(nums, 0, n-1);
        reverse(nums, 0, k-1);
        reverse(nums, k, n-1);
    }

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

• 注意这里反转函数reverse()对数组操作，每次使用首尾一一对应的元素进行反转；
• 旋转数组注意k>n的情况，一旦k=n，则相当于对数组不进行操作，故这里的k=k%n，取余数.
• Runtime：1ms
• 空间复杂度：O(1)