-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path241_DifferentWaysToAddParentheses241.java
58 lines (55 loc) · 1.5 KB
/
241_DifferentWaysToAddParentheses241.java
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
/**
* 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".
*
* ((2-1)-1) = 0
* (2-(1-1)) = 2
* Output: [0, 2]
*
*
* Example 2
* Input: "2*3-4*5"
*
* (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
* Output: [-34, -14, -10, -10, 10]
*
*/
public class DifferentWaysToAddParentheses241 {
public List<Integer> diffWaysToCompute(String input) {
List<Integer> res = new LinkedList<Integer>();
for (int i=0; i<input.length(); i++) {
char c = input.charAt(i);
if (c != '-' && c != '*' && c != '+' ) continue;
List<Integer> res1 = diffWaysToCompute(input.substring(0, i));
List<Integer> res2 = diffWaysToCompute(input.substring(i+1));
for (Integer int1: res1) {
for (Integer int2: res2) {
res.add(cal(int1, int2, c));
}
}
}
if (res.size() == 0) {
res.add(Integer.valueOf(input));
}
return res;
}
private Integer cal(Integer int1, Integer int2, Character op) {
switch (op) {
case '+':
return int1 + int2;
case '-':
return int1 - int2;
case '*':
return int1 * int2;
}
return 0;
}
}