-
Notifications
You must be signed in to change notification settings - Fork 0
/
1106.py
67 lines (55 loc) · 1.61 KB
/
1106.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
67
class Stack:
def __init__(self):
self.items = []
def isempty(self):
return self.items == []
def push(self, e):
self.items.append(e)
def pop(self):
if not (self.items == []):
return self.items.pop()
def top(self):
if not (self.items == []):
return self.items[-1]
def size(self):
return len(self.items)
class Solution:
def parseBoolExpr(self, expression: str) -> bool:
s = Stack()
n = 0
for i in expression:
if i != ',' and i != ')':
s.push(i)
if i == ')':
l = []
while s.top() != '(':
l.append(s.top())
s.pop()
s.pop()
temp = s.top()
s.pop()
if temp == '&':
num = n
for j in l:
if j == 'f':
num += 1
break
e = 'f' if num == 1 else 't'
s.push(e)
if temp == '|':
num = n
for j in l:
if j == 't':
num += 1
break
e = 't' if num == 1 else 'f'
s.push(e)
if temp == '!':
e = 't' if l[0] == 'f' else 'f'
s.push(e)
if s.top() == 't':
return True
else:
return False
S = Solution()
print(S.parseBoolExpr("&(t,f,f)"))