-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path괄호 변환.py
41 lines (35 loc) · 784 Bytes
/
괄호 변환.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
def check(s):
stack = []
for i in s:
if i == '(':
stack.append(i)
else:
if len(stack) == 0:
return False
stack.pop()
return True
def divide(s):
left, right = 0,0
for i in range(len(s)):
if s[i] == '(':
left += 1
else:
right += 1
if left == right:
return s[:i+1], s[i+1:]
def solution(p):
if not p:
return ''
u, v = divide(p)
if check(u):
return u + solution(v)
else:
answer = '('
answer += solution(v)
answer += ')'
for s in u[1:len(u)-1]:
if s == '(':
answer += ')'
else:
answer += '('
return answer