-
Notifications
You must be signed in to change notification settings - Fork 0
/
concatenationOfArray.js
49 lines (33 loc) · 1.12 KB
/
concatenationOfArray.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
// LeetCode #1929. Concatenation of Array
/* Instructions
Given an integer array nums of length n, you want to create an array ans of length 2n where ans[i] == nums[i] and ans[i + n] == nums[i] for 0 <= i < n (0-indexed).
Specifically, ans is the concatenation of two nums arrays.
Return the array ans.
Example 1:
Input: nums = [1,2,1]
Output: [1,2,1,1,2,1]
Explanation: The array ans is formed as follows:
- ans = [nums[0],nums[1],nums[2],nums[0],nums[1],nums[2]]
- ans = [1,2,1,1,2,1]
Example 2:
Input: nums = [1,3,2,1]
Output: [1,3,2,1,1,3,2,1]
Explanation: The array ans is formed as follows:
- ans = [nums[0],nums[1],nums[2],nums[3],nums[0],nums[1],nums[2],nums[3]]
- ans = [1,3,2,1,1,3,2,1]
Constraints:
n == nums.length
1 <= n <= 1000
1 <= nums[i] <= 1000
*/
// Solution
/**
* @param{number[]} nums
* @return{number[]}
*/
const getConcatenation = nums => [...nums, ...nums]
// const getConcatenation = nums => (nums.join('') + nums.join('')).split('')
// Explanation
// Use the spread operator ... on each array to spread each of them out into their constituent parts, and contain them within an array.