-
-
Notifications
You must be signed in to change notification settings - Fork 8
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
32nd exercise - leetcode.com/problems/shuffle-the-array/
- Loading branch information
1 parent
e1cf146
commit a680267
Showing
1 changed file
with
37 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,37 @@ | ||
/* | ||
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] | ||
*/ | ||
|
||
//Answer// | ||
|
||
/** | ||
* @param {number[]} nums | ||
* @param {number} n | ||
* @return {number[]} | ||
*/ | ||
var shuffle = function(nums, n) { | ||
let A = [] | ||
for (let i = 0; i < n ; i++) { | ||
A.push(nums[i]); | ||
A.push(nums.slice(n)[i]); | ||
}; | ||
return A | ||
}; |