-
Notifications
You must be signed in to change notification settings - Fork 0
/
1106. Parsing A Boolean Expression
136 lines (98 loc) · 2.77 KB
/
1106. Parsing A Boolean Expression
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
class Solution {
public boolean parseBoolExpr(String expression)
{
Stack<Character> stk = new Stack<>();
for(char curr : expression.toCharArray())
{
if(curr == ',' || curr == '(') continue;
if(
curr == 't' || curr == 'f' ||
curr == '!' || curr == '&' ||
curr == '|' )
{
stk.push(curr);
}
else if(curr == ')')
{
boolean iftrue = false, iffalse = false;
while(stk.peek() != '!' && stk.peek() != '&' && stk.peek() != '|')
{
char val = stk.pop();
if(val == 't') iftrue = true;
if(val == 'f') iffalse = true;
}
char op = stk.pop();
if(op == '!')
{
stk.push(iftrue ? 'f' : 't');
}
else if(op == '&')
{
stk.push(iffalse ? 'f' : 't');
}
else
{
stk.push(iftrue ? 't' : 'f');
}
}
}
return stk.peek() == 't';
}
/*
RUNTIME 6 MS, MEMORY 44.43 MB
public boolean parseBoolExpr(String expression)
{
return dfs(expression, 0, expression.length() - 1);
}
public boolean dfs(String expression, int s, int e) //start, end
{
if(s ==e)
{
return expression.charAt(s) == 't';
}
ArrayList<Boolean> exps = new ArrayList<>();
int layer = 0; int left = 0;
char op = ' ';
for(int i = s; i <= e; i++)
{
char c = expression.charAt(i);
if(layer == 0 && (c == '!' || c == '&' || c == '|'))
{
op = c;
}
else if(c == '(' && ++layer == 1)
{
left = i + 1;
}
else if(c == ')' && --layer == 0)
{
exps.add(dfs(expression, left, i - 1));
}
else if(c == ',' && layer == 1)
{
exps.add(dfs(expression, left, i - 1));
left = i + 1;
}
}
if(op == '&')
{
boolean result = true;
for(boolean exp : exps)
{
result &= exp;
}
return result;
}
if(op == '|')
{
boolean result = false;
for(boolean exp : exps)
{
result |= exp;
}
return result;
}
return !exps.get(0);
}
*/
}