leetcode解题方案--020--Valid Parentheses
2017-10-23 18:30
417 查看
题目
检查括号合法性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 static boolean isValid(String s) { Stack<Character> aa = new Stack<>(); char [] ss = s.toCharArray(); for (int i = 0; i<ss.length;i++) { switch (ss[i]) { case '{': aa.push('}'); break; case '[': aa.push(']'); break; case '(': aa.push(')'); break; default: if (aa.empty()) return false; char xxx = aa.peek(); if (xxx!=ss[i]) { return false; } else { aa.pop(); } } } return aa.empty(); }
相关文章推荐
- leetcode解题方案--032--Longest Valid Parentheses
- [leetcode javascript解题]Valid Parentheses
- [LeetCode] Valid Parentheses 解题报告
- 【LeetCode】20.Valid Parentheses解题报告
- leetCode 20.Valid Parentheses (有效的括号) 解题思路和方法
- LeetCode解题报告—— Longest Valid Parentheses
- [LeetCode] Longest Valid Parentheses 解题思路
- [LeetCode] Longest Valid Parentheses 解题报告
- LeetCode 020: Valid Parentheses
- [LeetCode] Valid Parentheses 解题报告
- [LeetCode] Valid Parentheses 解题报告
- leetcode 020 —— Valid Parentheses
- leetcode020 Valid Parentheses
- leetcode_c++:栈:Valid Parentheses(020)
- 【LeetCode】Valid Parentheses 解题报告
- leetcode_java.T020_ValidParentheses 给定一个只包含(‘, ‘)’, ‘{‘, ‘}’, ‘[’ 和‘]’的字符串,验证它是否是有效的。
- LeetCode020 Valid Parentheses
- LeetCode 020 Valid Parentheses
- 【LeetCode-面试算法经典-Java实现】【020-Valid Parentheses(括号验证)】
- 【LeetCode】Longest Valid Parentheses 解题报告