-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathmultidimensional-operations.js
80 lines (69 loc) · 2.36 KB
/
multidimensional-operations.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
console.log('---- Multidimensional Arrays --------');
let multiArr = [1, 2, [3, 4, [5, 6], 7], 8, 9, [10], 11];
/**
* Time Complexity : O(n)
* Space Complexity: O(n)
*/
const arrSum = (inputMultiArr) => {
let totalSum = 0;
inputMultiArr = inputMultiArr.flat(10);
for (let i = 0; i < inputMultiArr.length; i++) {
totalSum += inputMultiArr[i];
}
return totalSum;
}
console.log('arrSum() Result:', arrSum(multiArr));
console.log(`--------------------------`);
/**
* Time Complexity : O(n)
* Space Complexity: O(d) // here d denote for depth
*/
const arrSumRecursion = (inputMultiArr) => {
let totalSum = 0;
for (let i = 0; i < inputMultiArr.length; i++) {
if (Array.isArray(inputMultiArr[i])) {
totalSum += arrSumRecursion(inputMultiArr[i]);
} else {
totalSum += inputMultiArr[i];
}
}
return totalSum;
}
console.log('arrSumRecursion() Result:', arrSumRecursion(multiArr));
console.log(`--------------------------`)
/**
* Time Complexity : O(n)
* Space Complexity: O(n+d) // here d denote for depth
*/
const arrMultiplyRecursion = (inputMultiArr) => {
let totalMultiplyVal = 1;
for (let i = 0; i < inputMultiArr.length; i++) {
if (Array.isArray(inputMultiArr[i])) {
totalMultiplyVal *= arrMultiplyRecursion(inputMultiArr[i]);
} else {
totalMultiplyVal *= inputMultiArr[i];
}
}
console.log(typeof totalMultiplyVal, Number(totalMultiplyVal))
return totalMultiplyVal;
}
console.log('arrMultiplyRecursion() Result:', arrMultiplyRecursion(multiArr).toLocaleString());
console.log('------- Question: Write a recursive function called flatten which accepts an array of arrays and returns a new array with all values flattened.? -------');
/**
* Time Complexity : O(n)
* Space Complexity: O(n+d) // here d denote for depth
*/
const flatten = (inputArr, resultArr = []) => {
for (let i = 0; i < inputArr.length; i++) {
if (Array.isArray(inputArr[i])) {
flatten(inputArr[i], resultArr);
} else {
resultArr.push(inputArr[i]);
}
}
return resultArr;
}
console.log(flatten([1, 2, 3, [4, 5]])) // [1, 2, 3, 4, 5]
console.log(flatten([1, [2, [3, 4], [[5]]]])) // [1, 2, 3, 4, 5]
console.log(flatten([[1], [2], [3]])) // [1,2,3]
console.log(flatten([[[[1], [[[2]]], [[[[[[[3]]]]]]]]]])) // [1,2,3]