leetcode 1470. 重新排列数组

class Solution {
    public int[] shuffle(int[] nums, int n) {
        //用空间换时间
        int[] result = new int[nums.length];
        int next = 0;
        for (int i = 0; i < n; i++) {
            //写入值
            result[next] = nums[i];
            result[next + 1] = nums[i + n];
            next += 2;
        }
        return result;
    }
}

标签：shuffle,nums,int,next,1470,result,重新排列,leetcode
来源： https://blog.csdn.net/qq_35712788/article/details/115054548