class Solution {
public boolean isValid(String s) {
Deque<Character> deque = new LinkedList<>();
char ch;
for (int i = 0; i < s.length(); i++) {
ch = s.charAt(i);
//碰到左括号,就把相应的右括号入栈
if (ch == '(') {
deque.push(')');
}else if (ch == '{') {
deque.push('}');
}else if (ch == '[') {
deque.push(']');
} else if (deque.isEmpty() || deque.peek() != ch) {
return false;
// 1 防止上来直接就是右括号,
// 2 防止括号交叉匹配的情况 "{( } )"
// deque.isEmpty() or deque.peek() != ch
}else {//如果是右括号判断是否和栈顶元素匹配
deque.pop();
}
}
//最后判断栈中元素是否匹配
return deque.isEmpty();
}
}
理解难点:
else if (deque.isEmpty() || deque.peek() != ch)
为空或者
deque顶元素不等于ch中的元素