189. 旋转数组

189. 旋转数组

方法一：使用额外的数组

class Solution {
    public void rotate(int[] nums, int k) {
        int n = nums.length;
        int[] newArr = new int[n];
        for (int i = 0; i < n; ++i) {
            newArr[(i + k) % n] = nums[i];
        }
        System.arraycopy(newArr, 0, nums, 0, n);
    }
}

方法二：环状替换

class Solution {
    public void rotate(int[] nums, int k) {
        k = k % nums.length; //貌似可省略
        int count = 0;
        for (int start = 0; count < nums.length; start++){
            int current = start;
            int prev = nums[start];
            do {
                int next = (current + k) % nums.length;

                //交换
                int temp = nums[next];
                nums[next] = prev;
                prev = temp;

                current = next;
                count++; 统计交换次数，为n说明每个位置都发生过交换
            } while (start != current);
        }
    }
}

方法三：数组翻转

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);
    }

    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--;
        }
    }
}

方法四：暴力替换

class Solution {
    public void rotate(int[] nums, int k) {
        int temp, previous;
        for (int i = 0; i < k; i++){
            previous = nums[nums.length - 1];
            for (int j = 0; j < nums.length; j++){
                temp = nums[j];
                nums[j] = previous;
                previous = temp;
            }
        }
    }
}