LeetCode: 189. Rotate Array

LeetCode: 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.

[show hint]

Related problem: Reverse Words in a String II

Credits: Special thanks to @Freezen for adding this problem and
creating all test cases.

看了答案：

public class Solution {
    public void rotate(int[] nums, int k) {
        if (nums == null) {
            return;
        }
        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--;
        }
    }
}

最快的答案：

public class Solution {
    public void rotate(int[] nums, int k) {
        int n = nums.length;
        k = k%n;
        int[] tempt = new int[n];
        System.arraycopy(nums,0,tempt,k,n-k);
        System.arraycopy(nums,n-k,tempt,0,k);
        System.arraycopy(tempt,0,nums,0,n);
    }
}