Leetcode 189

189. 轮转数组

solution1 : 数组拷贝

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