-
Notifications
You must be signed in to change notification settings - Fork 155
/
Copy pathdifferent-ways-to-add-parentheses.js
72 lines (64 loc) · 1.39 KB
/
different-ways-to-add-parentheses.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
/**
* Different Ways to Add Parentheses
*
* Given a string of numbers and operators, return all possible results from
* computing all the different possible ways to group numbers and operators.
* The valid operators are +, - and *.
*
* Example 1:
*
* Input: "2-1-1"
* Output: [0, 2]
*
* Explanation:
* ((2-1)-1) = 0
* (2-(1-1)) = 2
*
* Example 2:
*
* Input: "2*3-4*5"
* Output: [-34, -14, -10, -10, 10]
*
* Explanation:
* (2*(3-(4*5))) = -34
* ((2*3)-(4*5)) = -14
* ((2*(3-4))*5) = -10
* (2*((3-4)*5)) = -10
* (((2*3)-4)*5) = 10
*/
/**
* @param {string} input
* @return {number[]}
*/
const diffWaysToCompute = input => {
const result = [];
for (let i = 1; i < input.length; i++) {
const c = input[i];
if (c === '+' || c === '-' || c === '*') {
const s1 = input.substring(0, i);
const s2 = input.substring(i + 1);
const l1 = diffWaysToCompute(s1);
const l2 = diffWaysToCompute(s2);
for (let n1 of l1) {
for (let n2 of l2) {
switch (c) {
case '+':
result.push(n1 + n2);
break;
case '-':
result.push(n1 - n2);
break;
case '*':
result.push(n1 * n2);
break;
}
}
}
}
}
if (result.length === 0) {
result.push(parseInt(input));
}
return result;
};
export { diffWaysToCompute };