-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path04. balanced-brackets.py
55 lines (41 loc) · 953 Bytes
/
04. balanced-brackets.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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'isBalanced' function below.
#
# The function is expected to return a STRING.
# The function accepts STRING s as parameter.
#
def isBalanced(s):
# Write your code here
stack = []
map = {
")" : "(",
"}" : "{",
"]" : "["
}
if len(s) % 2 == 1:
return "NO"
for item in s:
if item == "(" or item == "{" or item == "[":
stack.append(item)
elif len(stack) == 0:
return "NO"
elif len(stack) and (stack.pop() != map[item]):
return "NO"
if len(stack) > 0:
return "NO"
else:
return "YES"
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
t = int(input().strip())
for t_itr in range(t):
s = input()
result = isBalanced(s)
fptr.write(result + '\n')
fptr.close()