[Python/프로그래머스] 2020 KAKAO BLIND RECRUITMENT: 괄호 변환

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
def balance(w):
    open=close=0
    for idx, val in enumerate(list(w)):
        if val=='(': open+=1
        else: close+=1
        if open==close: return idx+1
    return 0

def correct(w):
    stack=[]
    for ch in list(w):
        if ch=='(': stack.append('(')
        else:
            if len(stack)==0: return False
            elif stack[-1]=='(': stack.pop()
            else: stack.append(')')
    if len(stack)==0: return True
    else: return False
    
def reverse(w):
    result=""
    for ch in list(w):
        if ch=='(': result+=')'
        else: result+='('
    return result

def solution(p):
    if p=='': return ''
    
    answer = ''
    idx=balance(p)
    u=p[:idx]
    v=p[idx:]
    if(correct(u)):
        return u+solution(v)
    else:
        answer='('+solution(v)+')'
        u=u[1:len(u)-1]
        answer+=reverse(u)
    return answer