-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
38 lines (36 loc) · 1.03 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
import java.util.Stack;
/**
* @author: changle
* @time: 2019-03-03 20:56
* source: https://leetcode.com/problems/valid-parentheses/
*/
class Solution {
public boolean isValid(String s) {
Stack<Character> stack = new Stack<>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if ('(' == c || '[' == c || '{' == c) {
stack.push(c);
} else {
if (stack.empty()) {
return false;
}
Character top = stack.pop();
if (')' == c) {
if (top != '(') {
return false;
}
} else if (']' == c) {
if ('[' != top) {
return false;
}
} else if ('}' == c) {
if ('{' != top) {
return false;
}
}
}
}
return stack.isEmpty();
}
}