leetcode 第20题<Valid Parentheses>(java)
2017-03-13 15:06
225 查看
题面
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.
审题
这道题主要考察的是栈结构 先进先出新出现的右括号要找到最后的左括号,看看能不能匹配
容易出错的是:1.遇见第一个右括号要判断栈里面是不是为空
2.字符循环完了,栈里面是不是为空
code
public class Solution { public boolean isValid(String s) { char[] arraychar=s.toCharArray(); List<Character> zhan= new ArrayList<>(); for (Character c:arraychar){ if(c=='{'||c=='['||c=='('){ zhan.add(c); } else{ if(zhan.size()==0){ return false; } if(c=='}'&&zhan.get(zhan.size()-1)!='{'){ return false; } if(c==']'&&zhan.get(zhan.size()-1)!='['){ return false; } if(c==')'&&zhan.get(zhan.size()-1)!='('){ return false; } zhan.remove(zhan.size()-1); } } if(zhan.size()==0) return true; else return false; } }
相关文章推荐
- <LeetCode OJ>Valid Parentheses【20】
- <LeetCode OJ> 20. Valid Parentheses
- 【JAVA、C++】LeetCode 020 Valid Parentheses
- LeetCode 20 Valid Parentheses (C,C++,Java,Python)
- LeetCode 20 : Valid Parentheses (Java)
- Longest Valid Parentheses leetcode java
- [Java] LeetCode32 Longest Valid Parentheses
- LeetCode – Valid Parentheses (Java)
- [leetcode-20]Valid Parentheses(java)
- 【LeetCode-面试算法经典-Java实现】【032-Longest Valid Parentheses(最长有效括号)】
- LeetCode 20 — Valid Parentheses(C++ Java Python)
- Valid Parentheses LeetCode java
- [LeetCode][Java] Valid Parentheses
- C实现 LeetCode->Valid Parentheses
- leetcode 第20-21题 Valid Parentheses & Generate Parentheses
- Java [leetcode 32]Longest Valid Parentheses
- leetcode第20题——*Valid Parentheses
- [Leetcode] Longest Valid Parentheses (Java)
- 【leetcode】Valid Parentheses【java】
- 【LeetCode-面试算法经典-Java实现】【020-Valid Parentheses(括号验证)】