Algorithm/0630_bracketExchange.py at master · junha6316/Algorithm · GitHub

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
import queue as q
def solution(st):
    qu=q.Queue()
    i=0
    n=len(st)
    while(i != n-1):
        for i in range(n):
            if st[i] == '(':
                qu.put('(')
            elif st[i] == ')' and qu.qsize() != 0:
                qu.get()

            if qu.qsize() ==0:
                u=st[:i+1]
                v=st[i:]
                break

        i += 1

    return u,v

st="(()())()"

print(solution(st))

# ''
#
#
# 1.check right bracket string
#
# '''
#
# def checkRightBracket(st):
#     qu=q.Queue()
#     for i in range(len(st)):
#         if st[i] == '(':
#             qu.put('(')
#         elif st[i] == ')' and qu.qsize() != 0:
#             qu.get()
#         elif st[i] ==')' and qu.qsize() ==0:
#             return False
#
#     if q.size() !=0:
#         return False
#     else:
#         return True