题目:
Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.
The brackets must close in the correct order, “()” and “()[]{}” are all valid but “(]” and “([)]” are not.
大意:
给定一个只包含(‘, ‘)’, ‘{‘, ‘}’, ‘[’ 和‘]’的字符串,验证它是否是有效的。括号必须配对,并且要以正确的顺序。
思路:
用一个栈来对输入的括号串进行处理,如果是左括号就入栈,如果是右括号就与栈顶元素看是否组成一对括号,组成就弹出,并且处理下一个输入的括号,如果不匹配就直接返回结果。
代码:
public class Solution {
public boolean isValid(String s) {
Map<Character, Character> map = new HashMap<>();
map.put('(', ')');
map.put('[', ']');
map.put('{', '}');
Stack<Character> stack = new Stack<>();
for(int i = 0; i < s.length(); i++) {
char current = s.charAt(i);
//keySet()取出map所有的key作为set
if(map.keySet().contains(current)) {
stack.push(current);
} else if(map.values().contains(current)) {
//values()取出map中所有value作为set
if(!stack.empty() && map.get(stack.peek()) == current) {
stack.pop();
} else {
return false;
}
}
}
return stack.empty();
}
}