-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathsolution.py
30 lines (24 loc) · 828 Bytes
/
solution.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
def solution(expression):
answer = []
priorities = [
('*', '-', '+'),
('*', '+', '-'),
('+', '-', '*'),
('+', '*', '-'),
('-', '*', '+'),
('-', '+', '*')
]
for priority in priorities:
answer.append(int(calc(priority, 0, expression)))
return max(map(abs, answer))
def calc(priority, n, expression):
if n == 2:
return str(eval(expression))
if priority[n] == '*':
res = eval('*'.join([calc(priority, n + 1, e) for e in expression.split('*')]))
if priority[n] == '+':
res = eval('+'.join([calc(priority, n + 1, e) for e in expression.split('+')]))
if priority[n] == '-':
res = eval('-'.join([calc(priority, n + 1, e) for e in expression.split('-')]))
return str(res)
solution('100-200*300-500+20')