forked from singlemancombat/interview-preparation
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDifferentWaystoAddParentheses.java
More file actions
61 lines (46 loc) · 1.58 KB
/
Copy pathDifferentWaystoAddParentheses.java
File metadata and controls
61 lines (46 loc) · 1.58 KB
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
/*
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 Solution {
public List<Integer> diffWaysToCompute(String input) {
return helper(input, new HashMap<String, List<Integer>>());
}
private List<Integer> helper(String s, Map<String, List<Integer>> map){
if (map.containsKey(s))
return map.get(s);
List<Integer> result = new ArrayList<Integer>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if (c == '+' || c == '-' || c == '*') {
List<Integer> left = helper(s.substring(0, i), map);
List<Integer> right = helper(s.substring(i + 1), map);
for (int l : left)
for (int r : right) {
if (c == '+')
result.add(l + r);
else if (c == '-')
result.add(l - r);
else
result.add(l * r);
}
}
}
if (result.size() == 0)
result.add(Integer.valueOf(s));
map.put(s, result);
return result;
}
}