原题链接:https://leetcode-cn.com/problems/valid-parentheses/
20. 有效的括号
给定一个只包括 ‘(’,’)’,’{’,’}’,’[’,’]’ 的字符串,判断字符串是否有效。
有效字符串需满足:
左括号必须用相同类型的右括号闭合。
左括号必须以正确的顺序闭合。
注意空字符串可被认为是有效字符串。
示例 1:
输入: “()”
输出: true
示例 2:
输入: “()[]{}”
输出: true
示例 3:
输入: “(]”
输出: false
示例 4:
输入: “([)]”
输出: false
示例 5:
输入: “{[]}”
输出: true
思路
1.使用栈
如果遇到左括号,则将其压入栈中,如果遇到右括号,则检测栈顶元素是否与之相配,如果不配则返回false,相配则将栈顶元素弹出,继续下一元素的判断。最后如果字符串为空则返回true,否则返回false
2.暴力替换
循环替换字符串中的括号对为空串,如果最后字符串无可替换则跳出循环体,最后如果字符串为空则返回true,否则返回false
代码实现
1.栈
class Solution {
// 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();
}
}
作者:LeetCode
链接:https://leetcode-cn.com/problems/valid-parentheses/solution/you-xiao-de-gua-hao-by-leetcode/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
2.暴力法
class Solution {
public static boolean isValid(String s) {
char[] chars = s.toCharArray();
if (chars.length%2!=0){//奇数肯定不是
return false;
}
if (s.isEmpty()) return true;
for (int i=0;i<chars.length/2;i++){
s = s.replaceAll("\\(\\)","")
.replaceAll("\\[\\]","")
.replaceAll("\\{\\}","");
if (s.isEmpty()) return true;
}
return false;
}
}
作者:quirky-pare
链接:https://leetcode-cn.com/problems/valid-parentheses/solution/you-mei-you-he-wo-yi-yang-jian-dan-cu-bao-replace-/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
总结
善于使用数据结构是很重要的