Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn].
Return the array in the form [x1,y1,x2,y2,...,xn,yn].
Example 1:
Input: nums = [2,5,1,3,4,7], n = 3
Output: [2,3,5,4,1,7]
Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7].
Example 2:
Input: nums = [1,2,3,4,4,3,2,1], n = 4
Output: [1,4,2,3,3,2,4,1]
Example 3:
Input: nums = [1,1,2,2], n = 2
Output: [1,2,1,2]
class Solution {
public int[] shuffle(int[] nums, int n) {
int[] result = new int[nums.length];
for(int i = 0; i < n; i++){
result[i*2] = nums[i];
}
for(int j = 1; j < n+1; j++) {
result[(j*2)-1] = nums[n+j-1];
}
return result;
}
}