1400 - 1499
1470 - Shuffle the Array (Easy)
Problem Link
https://leetcode.com/problems/shuffle-the-array/
Problem Statement
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 <= 500nums.length == 2n1 <= nums[i] <= 10^3
Approach 1: One Pass
// the first half n elements are x and the second half n elements are y
// we can iterate n times and push nums[i] and nums[i + n]
// since the distance for each x_i and y_i is just `n`
class Solution {
public:
vector<int> shuffle(vector<int>& nums, int n) {
vector<int> ans;
for (int i = 0; i < n; i++) {
// push x_1 .. x_n
ans.push_back(nums[i]);
// push y_1 .. y_n
ans.push_back(nums[i + n]);
}
return ans;
}
};1464 - Maximum Product of Two Elements in an Array (Easy)
Author: @wkw, @jaffar, @jit | https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/
1475 - Final Prices With a Special Discount in a Shop (Easy)
Author: @heiheihang | https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/