Catalog
  1. 1. 1470. Shuffle the Array
LeetCode Solution: 1470. Shuffle the Array

1470. Shuffle the Array

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]

Constraints:

  • 1 <= n <= 500
  • nums.length == 2n
  • 1 <= nums[i] <= 10^3

解析

1
2
3
4
5
6
7
8
9
10
11
12
class Solution {
public:
vector<int> shuffle(vector<int>& nums, int n) {
std::vector<int> res;
for (int i = 0; i < n; ++i) {
res.push_back(nums[i]);
res.push_back(nums[n + i]);
}

return res;
}
};

基本解析,对输入数组进行遍历,每次添加两个数,第一个数为下标为i的数,第二个数为n+i

时间复杂度为O(n)

Author: Jsthcit
Link: http://jsthcitpizifly.com/2020/06/14/LeetCode-Solution-1470/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.
Donate
  • 微信
  • 支付寶