-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathflattenAnArray.js
84 lines (69 loc) · 2.26 KB
/
flattenAnArray.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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
const arr = [1, [2, [3], [[4], 5]]];
// BUILD IN METHOD
const oneLevelFlat = arr.flat(1);
console.log(oneLevelFlat); // [ 1, 2, [ 3 ], [ [ 4 ], 5 ] ]
const twoLevelFlat = arr.flat(2);
console.log(twoLevelFlat); // [ 1, 2, 3, [ 4 ], 5 ]
const deepFlat = arr.flat(Infinity);
console.log(deepFlat); // [ 1, 2, 3, 4, 5 ]
// ================================================================================================ //
// Without using any build method we can solve by recursion
const deeplyFlat = (inputArray, tempArray = []) => {
// base case
if (!Array.isArray(inputArray)) {
tempArray.push(inputArray);
return;
}
for (let i = 0; i < inputArray.length; i++) {
deeplyFlat(inputArray[i], tempArray);
}
return tempArray;
};
const deeplyFlat2 = (inputArray, tempArray = []) => {
for (let i = 0; i < inputArray.length; i++) {
if (Array.isArray(inputArray[i])) {
deeplyFlat2(inputArray[i], tempArray);
} else {
tempArray.push(inputArray[i]);
}
}
return tempArray;
};
const customFun = deeplyFlat(arr);
console.log(customFun); // [ 1, 2, 3, 4, 5 ]
const customFun2 = deeplyFlat2(arr);
console.log(customFun2); // [ 1, 2, 3, 4, 5 ]
// ================================================================================================== //
// Flatten Deeply Nested Array
// https://leetcode.com/problems/flatten-deeply-nested-array/description/
const flat = (inputArray, n, tempArray = []) => {
// base case
if (!Array.isArray(inputArray) || n <= -1) {
tempArray.push(inputArray);
return;
}
for (let i = 0; i < inputArray.length; i++) {
flat(inputArray[i], n - 1, tempArray);
}
return tempArray;
};
const flat2 = (inputArray, n, tempArray = []) => {
for (let i = 0; i < inputArray.length; i++) {
if (Array.isArray(inputArray[i]) && n > 0) {
flat2(inputArray[i], n - 1, tempArray);
} else {
tempArray.push(inputArray[i]);
}
}
return tempArray;
};
const output = flat(
[1, 2, 3, [4, 5, 6], [7, 8, [9, 10, 11], 12], [13, 14, 15]],
1
);
console.log(output); // [ 1, 2, 3, 4, 5, 6, 7, 8, [ 9, 10, 11 ], 12, 13, 14, 15 ]
const output2 = flat2(
[1, 2, 3, [4, 5, 6], [7, 8, [9, 10, 11], 12], [13, 14, 15]],
1
);
console.log(output2); // [ 1, 2, 3, 4, 5, 6, 7, 8, [ 9, 10, 11 ], 12, 13, 14, 15 ]