-
-
Notifications
You must be signed in to change notification settings - Fork 1.9k
/
Solution.java
40 lines (37 loc) · 1.05 KB
/
Solution.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
package 栈相关.q20_有效的括号;
import java.util.Stack;
/**
* 利用栈 o(n)
*/
public class Solution {
public boolean isValid(String s) {
Stack<Character> stack = new Stack<>();
for (int i = 0; i < s.length(); i++) {
char t = s.charAt(i);
if (t == '(' || t == '[' || t == '{') {
stack.push(t);
} else {
if (stack.empty()) {
return false;
}
if (t == ')') {
if (stack.pop() != '(') {
return false;
}
} else if (t == ']') {
if (stack.pop() != '[') {
return false;
}
} else {
if (stack.pop() != '{') {
return false;
}
}
}
}
return stack.empty();
}
public static void main(String[] args) {
System.out.println(new Solution().isValid("()"));
}
}