189. Rotated Array

一开始要进行取余操作

class Solution {
    public void rotate(int[] nums, int k) {
        if (nums.length == 0 || nums == null){
            return;
        }
        k %= nums.length;
        //7 6 5 4 3 2 1
        swap(nums, 0, nums.length-1);
        //5 6 7 4 3 2 1
        swap(nums,0, k-1);
        //5 6 7 1 2 3 4
        swap(nums,k,nums.length-1);
    }
    
    public void swap(int[] nums, int i, int j){
        while(i < j){
            int temp = nums[i];
            nums[i] = nums[j];
            nums[j] = temp;
            i++;
            j--;
        }
    }
}

 

转载于:https://my.oschina.net/u/3457852/blog/1538549