-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathsh.py
More file actions
66 lines (56 loc) · 2.42 KB
/
sh.py
File metadata and controls
66 lines (56 loc) · 2.42 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
62
63
64
65
66
import re
def solution(expression):
cases = [['-','+','*'],['+','-','*'],['+','-','*'],['+','*','-'],['*','+','-'],['*','-','+']]
num = re.split('[-|+|*]',expression)
etc = re.split('[0|1|2|3|4|5|6|7|8|9]',expression)
#num = re.split('([-|+|*])',expression) 으로 사용시 부호도 같이 num에 들어감
etc = [i for i in etc if i not in '']
ans_list = list()
for ci in cases: #cases를 카운트
for ei in range(len(etc)):
print (ei)
if (etc[ei] == ci[0]):
result = str(eval(num[ei]+etc[ei]+num[ei+1]))
num.insert(ei,result)
num.remove(num[ei])
num.remove(ei+1)
print('ei :', num[ei], 'ei+1 :', num[ei+1])
print ('----결과',num, '\nei : ', ei,' ', etc[ei], ' ci : ', ci )
#del num[ei+2]
#print(num[ei])
#del num[ei]
"""
num.insert(int(num[ei+2]),result)
num.pop(int(num[ei+1]))
num.pop(int(etc[ei]))
# num[ei] = result"""
#print (num,' ', etc, '\nei : ', ei,' ', etc[ei], ' ci : ', ci )
"""
for ei in range(len(etc)):
if (etc[ei] == ci[1]):
result = eval(num[ei]+etc[ei]+num[ei+1])
print (result,' ', num, '\nei : ', ei,' ', etc[ei], ' ci : ', ci )
num.insert(ei,result)
print(num[ei])
#del num[ei]
#num.
num.pop(num[ei])
num.pop(num[ei+1])
num.pop(etc[ei])
num[ei] = str(result)
for ei in range(len(etc)):
if (etc[ei] == ci[2]):
result = eval(num[ei]+etc[ei]+num[ei+1])
print (result,' ', num, '\nei : ', ei,' ', etc[ei], ' ci : ', ci )
num.insert(ei,result)
print(num[ei])
#del num[ei]
num.pop(num[ei])
num.pop(num[ei+1])
num.pop(etc[ei])
num[ei] = str(result)
#ans_list.append(num)
#print (result,' ', etc, '\nei : ', ei,' ', etc[ei], ' ci : ', ci )
answer = 0#max(ans_list)
return answer
#https://latte-is-horse.tistory.com/200"""