方法一:蛮力法
class Solution {
public int[] shuffle(int[] nums, int n) {
int[] nums2 = new int[n];
int[] ret = new int[2 * n];
int a = 0;
int b = 0;
for(int i = 0; i < ret.length; i++){
if(i % 2 == 0){//偶数
ret[i] = nums[a];
a++;
}else if(i % 2 == 1){//奇数
ret[i] = nums[n+b];
b++;
}
}
return ret;
}
}