leetcode-1470. 重新排列数组

1
2
3
4
5
6
7
8
9
10
11
class Solution {
    public int[] shuffle(int[] nums, int n) {
        int[] ans = new int[2*n];
        int idx = 0;
        for (int i = 0; i < n; i++) {
            ans[idx++] = nums[i];
            ans[idx++] = nums[n + i];
        }
        return ans;
    }
}