forked from altruistcoder/Data-Structures-Python
-
Notifications
You must be signed in to change notification settings - Fork 0
/
parenthesis_balanced_checking.py
66 lines (55 loc) · 1.4 KB
/
parenthesis_balanced_checking.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
56
57
58
59
60
61
62
63
64
65
66
class Stack:
def __init__(self):
self.items = []
def isEmpty(self):
return self.items == []
def push(self, item):
self.items.append(item)
def pop(self):
return self.items.pop()
def peek(self):
return self.items[len(self.items) - 1]
def size(self):
return len(self.items)
def parChecker(symbolString):
s = Stack()
for i in symbolString:
if i == '(' or i == '{' or i == '[':
s.push(i)
continue
if s.isEmpty():
return False
x = s.peek()
s.pop()
if i == ')' and (x == '{' or x == '['):
return False
elif i == '}' and (x == '(' or x == '['):
return False
elif i == ']' and (x == '(' or x == '{'):
return False
return s.isEmpty()
# from pythonds.basic.stack import Stack
#
#
# def parChecker(symbolString):
# s = Stack()
# balanced = True
# index = 0
# while index < len(symbolString) and balanced:
# symbol = symbolString[index]
# if symbol == "(":
# s.push(symbol)
# else:
# if s.isEmpty():
# balanced = False
# else:
# s.pop()
#
# index = index + 1
#
# if balanced and s.isEmpty():
# return True
# else:
# return False
s = input("Enter a string: ")
print(parChecker(s))