Rotate Array

Description

Rotate an array of n elements to the right by k steps.
Could you do it in-place with O(1) extra space?

问题描述

将一个数组向右旋转k步，这个题目和之前的旋转链表类似，但是这次处理的是数组，所以方法还是不同的。

Ex:

旋转操作比较抽象，用例子说明
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].
也就是把原始数组的[5 6 7]和[1 2 3]对调

Note:

Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
本地操作，消耗O(1)的空间

解法一：

思路：

先将原始数组整个转置，然后将转置后的数组的前k个元素和其余的元素分别转置。
这里的转置私有函数为原地操作

Code:

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