标签：优先 false 队列 top char return stack
内容来自刘宇波老师玩转算法面试
1、栈的基础应用
20 - 有效的括号
public static boolean isValid(String s) {
Stack<Character> stack = new Stack<>();
char[] chars = s.toCharArray();
for (char c : chars) {
if (c == '(' || c == '{' || c == '[') stack.push(c);
else {
if (stack.isEmpty()) return false;
char top = stack.pop();
if (c == ')' && top != '(') return false;
if (c == '}' && top != '{') return false;
if (c == ']' && top != '[') return false;
}
}
return stack.isEmpty();
}
2、栈和递归的密切关系
标签：优先,
false,
队列,
top,
char,
return,
stack
From： https://www.cnblogs.com/lidong422339/p/17396033.html