-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathProblem20.java
44 lines (41 loc) · 1.23 KB
/
Problem20.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
import java.util.*;
class Problem20 {
public static void main(String[] args) {
System.out.println(new Problem20().isValid("{}[(])"));
}
public boolean isValid(String s) {
if (s.length() <= 0) return true;
Stack<Character> stack = new Stack<>();
int i = 0;
char cur = s.charAt(i);
while(( cur = s.charAt(i) )!= '\0') {
switch (cur) {
case ']':
if (stack.isEmpty()) return false;
char c = stack.pop();
if (c != '[') return false;
break;
case '}':
if (stack.isEmpty()) return false;
c = stack.pop();
if (c != '{') return false;
break;
case ')':
if (stack.isEmpty()) return false;
c = stack.pop();
if (c != '(') return false;
break;
default:
stack.push(cur);
}
++i;
if (i == s.length()) {
break;
}
}
if (stack.isEmpty()) {
return true;
}
return false;
}
}