-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path241 Different Ways to Add Parentheses.py
67 lines (51 loc) · 1.54 KB
/
241 Different Ways to Add Parentheses.py
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
"""
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]
Author: Rajeev Ranjan
"""
import re
class Solution:
def diffWaysToCompute(self, input):
"""
Looping + Divide & Conquer
:type: input
:rtype: list[]
"""
input_lst = re.split(r"(\D)", input) # capturing parentheses
nums = map(int, filter(lambda x: re.match(r"\d+", x), input_lst))
ops = filter(lambda x: re.match(r"\D", x), input_lst)
ret = self.dfs_eval(nums, ops)
return ret
def dfs_eval(self, nums, ops):
ret = []
if not ops:
assert len(nums) == 1
return nums
for i, op in enumerate(ops):
left_vals = self.dfs_eval(nums[:i+1], ops[:i])
right_vals = self.dfs_eval(nums[i+1:], ops[i+1:])
for l in left_vals:
for r in right_vals:
ret.append(self._eval(l, r, op))
return ret
def _eval(self, a, b, op):
return {
"+": lambda a, b: a+b,
"-": lambda a, b: a-b,
"*": lambda a, b: a*b,
}[op](a, b)
if __name__ == "__main__":
assert Solution().diffWaysToCompute("1+1") == [2]