-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
241.py
51 lines (45 loc) · 1.94 KB
/
241.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
__________________________________________________________________________________________________
sample 28 ms submission
class Solution:
def __init__(self):
self.memo = {}
def diffWaysToCompute(self, input: str) -> List[int]:
if input in self.memo:
return self.memo[input]
res = []
for i in range(len(input)):
if input[i] in '+-*':
left = self.diffWaysToCompute(input[:i])
right = self.diffWaysToCompute(input[i+1:])
for l in left:
for r in right:
if input[i] == '+':
res.append(l+r)
elif input[i] == '-':
res.append(l-r)
else:
res.append(l*r)
if len(res)==0:
res.append(int(input))
self.memo[input] = res
return res
__________________________________________________________________________________________________
sample 13128 kb submission
class Solution:
def diffWaysToCompute(self, input: str) -> List[int]:
if input.isdigit():
return [int(input)]
return self.allPossibleValues(input)
def allPossibleValues(self, input):
if input.isdigit():
return [int(input)]
res = []
for i in range(len(input)):
if input[i] in ('+', '-', '*'):
leftPossibleValues = self.allPossibleValues(input[:i])
rightPossibleValues = self.allPossibleValues(input[i + 1:])
for l_each in leftPossibleValues:
for r_each in rightPossibleValues:
res.append(eval(str(l_each)+ input[i] + str(r_each)))
return res
__________________________________________________________________________________________________