Give you an array nums, there are 2n elements in the array, arranged in the format [x1,x2,...,xn,y1,y2,...,yn]. Please rearrange the array in the format [x1,y1,x2,y2,…,xn,yn] and return the rearranged array.
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, 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]
Algorithm 1: Combine the two pieces of data of the array into a new array
int Shuffle(int* nums, int numsSize, int* returnSize)//O(n),O(n)
{
int *brr = (int *)malloc(numsSize*sizeof(int));
int j = 0;
int half = numsSize/2;
for(int i=0;i<half;i++)
{
brr[j++] = nums[i];
brr[j++] = nums[i+half];
}
*returnSize = numsSize;
return brr;
}
Algorithm 1: Use vector array push_back to insert the tail
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[i + n]);
}
return res;
}
};