给定一个只包括 ‘(’,’)’,’{’,’}’,’[’,’]’ 的字符串,判断字符串是否有效。
有效字符串需满足:
- 左括号必须用相同类型的右括号闭合。
- 左括号必须以正确的顺序闭合。
注意空字符串可被认为是有效字符串。
示例 1:
输入: “()”
输出: true
示例 2:
输入: “()[]{}”
输出: true
示例 3:
输入: “(]”
输出: false
示例 4:
输入: “([)]”
输出: false
示例 5:
输入: “{[]}”
输出: true
思路
用一个栈来存字符串,"(","[","{“入栈,”)","]","}"出栈,出栈时检查一下括号类型是否匹配,如果程序结束,栈为空,说明匹配成功,奇数长度肯定是错误的,开始时判断一下。
代码实现:
public boolean isValid(String s) {
if(s.length()%2 != 0){
return false;
}
Stack<Character> stack = new Stack<>();
try{
for(int i = 0;i<s.length();i++){
judgeAction(stack,s.charAt(i));
}
}catch (Exception e){
e.printStackTrace();
return false;
}
if(stack.empty()){
return true;
}else{
return false;
}
}
private void judgeAction(Stack<Character> stack,Character c) throws Exception{
switch (c){
case '(':
case '[':
case '{':
stack.push(c);break;
case ')':if(stack.peek() == '('){
stack.pop();
}else{
throw new Exception("");
};break;
case ']':if(stack.peek() == '['){
stack.pop();
}else{
throw new Exception("");
};break;
case '}':if(stack.peek() == '{'){
stack.pop();
}else{
throw new Exception("");
};break;
}
}
提交后发现执行了11ms,平均水平的11%,所以肯定是存在问题的。
我的代码使用了switch来判断出现的括号,好像有些麻烦了,使用map,将3种类型的括号对应起来,好像代码会非常的简洁。
官方解法
// Hash table that takes care of the mappings.
private HashMap<Character, Character> mappings;
// Initialize hash map with mappings. This simply makes the code easier to read.
public Solution() {
this.mappings = new HashMap<Character, Character>();
this.mappings.put(')', '(');
this.mappings.put('}', '{');
this.mappings.put(']', '[');
}
public boolean isValid(String s) {
// Initialize a stack to be used in the algorithm.
Stack<Character> stack = new Stack<Character>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
// If the current character is a closing bracket.
if (this.mappings.containsKey(c)) {
// Get the top element of the stack. If the stack is empty, set a dummy value of '#'
char topElement = stack.empty() ? '#' : stack.pop();
// If the mapping for this bracket doesn't match the stack's top element, return 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();
}
实际执行下来8ms,平均值的33%。
评论里看到有个思路爆炸的写法,特别简洁,当然,效率不是一般的低,183ms。。。
public boolean isValid(String s) {
while(s.contains("()") || s.contains("[]") || s.contains("{}")){
s = s.replace("()","");
s = s.replace("[]","");
s = s.replace("{}","");
}
if(s.length() == 0){
return true;
}else{
return false;
}
}