1
class Solution {
2
  public int[] shuffle(int[] nums, int n) {
3
    int[] arr = new int[2 * n];
4
    int j = 0;
5
    int k = n;
6
    for (int i = 0; i < 2 * n; i++) {
7
      if (i % 2 == 0) {
8
        arr[i] = nums[j];
9
        j++;
10
      } else {
11
        arr[i] = nums[k];
12
        k++;
13
      }
14
    }
15
    return arr;
16
  }
17
}