Shuffle the Array
给一个array, 一共2n个元素, 求重组后的array, 让前n个元素和后n个元素互相交叉.
class Solution {
public:
vector<int> shuffle(vector<int>& nums, int n) {
vector<int> res;
for(int i = 0; i < n; i++) {
res.push_back(nums[i]);
res.push_back(nums[n+i]);
}
return res;
}
};