题目链接:https://leetcode-cn.com/problems/valid-parentheses/
思路:用map标记一对括号(方便判断栈顶的元素是不是等于当前的右半边括号),用栈来存一对括号的左半边,当来了一个右半边括号匹配不到栈顶的括号的时候或者此时栈为空的时候(空就是匹配不到对应的左半边括号)就return false,匹配到就pop()掉栈顶的左括号。最后判断栈是不是空的,空的说明都匹配上了,是有效的,否则是无效的。
上代码:
class Solution {
public boolean isValid(String s) {
Map<Character,Character> map = new HashMap<>();
map.put(')','(');
map.put(']','[');
map.put('}','{');
Stack<Character> stack = new Stack<>();
int len = s.length();
for (int i = 0; i < len; i++) {
Character character = s.charAt(i);
if (character.equals('(') || character.equals('[') || character.equals('{')) {
stack.push(character);
} else {
if (!stack.isEmpty() && stack.peek().equals(map.get(character))) {
stack.pop();
} else {
return false;
}
}
}
return stack.isEmpty();
}
}