给定一个只包括 '(',')','{','}','[',']' 的字符串,判断字符串是否有效。
有效字符串需满足:
左括号必须用相同类型的右括号闭合。
左括号必须以正确的顺序闭合。
注意空字符串可被认为是有效字符串。
示例 1:
输入: "()"
输出: true
示例 2:
输入: "()[]{}"
输出: true
输入: "(]"
输出: false
示例 4:
输入: "([)]"
输出: false
示例 5:
输入: "{[]}"
输出: true
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/valid-parentheses
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
审题:
思考:
解题:
private HashMap<Character, Character> mappings;
public Solutions() {
this.mappings = new HashMap<Character, Character>();
this.mappings.put(')', '(');
this.mappings.put('}', '{');
this.mappings.put(']', '[');
}
public boolean isValid2(String s) {
String str = s.substring(1, s.length() - 1);
// Initialize a stack to be used in the algorithm.
Stack<Character> stack = new Stack<Character>();
for (int i = 0; i < str.length(); i++) {
char c = str.charAt(i);
// If the current character is a closing bracket.
// map.containsKey(key); //判断是否包含指定的键值
boolean ss = this.mappings.containsKey(c);
if (ss) {
// Get the top element of the stack. If the stack is empty, set a dummy value of
// '#'
// 获取堆栈顶部元素,如果是空的,设置为#
// stack.empty()判断是否为空
char topElement = stack.empty() ? '#' : stack.pop();
// If the mapping for this bracket doesn't match the stack's top element, return
// false.
//如果此括号的映射与堆栈的顶部元素不匹配,则返回false
if (topElement != this.mappings.get(c)) {
return false;
}
} else {
// If it was an opening bracket, push to the stack.
//如果它是一个左括号,推到堆栈。
stack.push(c);
}
}
// If the stack still contains elements, then it is an invalid expression.
//如果堆栈仍然包含元素,则它是一个无效表达式。
return stack.isEmpty();
}
public boolean isValid3(String s) {
String str = s.substring(1, s.length() - 1);
Stack<Character> stack = new Stack<Character>();
for (char c : str.toCharArray()) {
if (c == '(')
stack.push(')');
else if (c == '{')
stack.push('}');
else if (c == '[')
stack.push(']');
//判断是否包含元素
else if (stack.isEmpty()|| stack.pop() != c)
return false;
}
//为空返回true
return stack.isEmpty();
}
知识点: