-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathHard1106.java
58 lines (45 loc) · 1.24 KB
/
Hard1106.java
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
import java.util.ArrayList;
import java.util.List;
import java.util.Stack;
class Hard1106{
public char evalExpr(char op, List<Character> list){
if (op =='!'){
return list.get(0)=='t'?'f':'t';
}
else if (op == '&'){
for (char c: list){
if(c=='f'){
return 'f';
}
}
return 't';
} else if (op =='|'){
for (char c: list){
if(c=='t'){
return 't';
}
}
return 'f';
}
return 'f';
}
public boolean parseBoolExpr(String expression) {
//"!(&(f,t))"
Stack<Character> stack = new Stack<>();
for (char c:expression.toCharArray()){
if (c == ')'){
List<Character>list=new ArrayList<>();
while (stack.peek() != '('){
list.add(stack.pop());
}
stack.pop();
char op=stack.pop();
char res= evalExpr(op,list);
stack.push(res);
} else if (c !=','){
stack.push(c);
}
}
return stack.peek() == 't'? true : false;
}
}