LC-1470 C++ JavaScript accepted

LC-1470/LC-1470.cpp

@@ -0,0 +1,15 @@
+#include <vector>
+
+using namespace std;
+
+class Solution {
+public:
+    vector<int> shuffle(vector<int>& nums, int n) {
+        vector<int> result(2 * n);
+        for (int i = 0, j = n, k = 0; i < n && j < 2 * n && k < 2 * n; ++i, ++j, k += 2) {
+            result[k] = nums[i];
+            result[k + 1] = nums[j];
+        }
+        return result;
+    }
+};

LC-1470/LC-1470.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} nums
+ * @param {number} n
+ * @return {number[]}
+ */
+var shuffle = function (nums, n) {
+  let result = [];
+  for (
+    let i = 0, j = n, k = 0;
+    i < n && j < 2 * n && k < 2 * n;
+    ++i, ++j, k += 2
+  ) {
+    result[k] = nums[i];
+    result[k + 1] = nums[j];
+  }
+  return result;
+};

LC-1470/README.md

@@ -0,0 +1,41 @@
+# LC-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]`.
+
+> * Difficulty: **EASY**
+
+---
+## Examples
+
+```
+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].
+```
+
+```
+Input: nums = [1,2,3,4,4,3,2,1], n = 4
+Output: [1,4,2,3,3,2,4,1]
+```
+
+```
+Input: nums = [1,1,2,2], n = 2
+Output: [1,2,1,2]
+```
+
+---
+## Notes
+
+* `1 <= n <= 500`
+* `nums.length == 2n`
+* `1 <= nums[i] <= 10^3`
+
+---
+## Solutions
+
+1. Extra-space
+    * Time complexity: $O(n)$
+    * Space complexity: $O(n)$