[LeetCode] Valid Parentheses
2014-08-25 11:25
281 查看
Given a string containing just the characters
The brackets must close in the correct order,
方法:用stack<char> 进行配对即可。
'(',
')',
'{',
'}',
'['and
']', determine if the input string is valid.
The brackets must close in the correct order,
"()"and
"()[]{}"are all valid but
"(]"and
"([)]"are not.
方法:用stack<char> 进行配对即可。
class Solution { public: bool isValid(string s) { int len = s.size(); if(len==0) return true; else if(s[0]==')'|| s[0]==']'|| s[0]=='}') return false; stack<char> st; for(int i=0;i<len;i++){ if(st.empty()){ st.push(s[i]); }else if((s[i]=='}' && st.top()!='{')||(s[i]==')' && st.top()!='(')||(s[i]==']' && st.top()!='[')){ return false; }else if((s[i]=='}' && st.top()=='{')||(s[i]==')' && st.top()=='(')||(s[i]==']' && st.top()=='[')){ st.pop(); }else{ st.push(s[i]); } }//end for if(st.empty()) return true; else return false; }//end func };
相关文章推荐
- [Leetcode] 32. Longest Valid Parentheses
- leetcode32 Longest Valid Parentheses 最长有效括号序列
- leetcode做题总结,题目Valid Parentheses 2012/01/30
- leetcode:Valid Parentheses
- LeetCode 32. Longest Valid Parentheses (Hard)
- leetcode Longest Valid Parentheses
- LeetCode-20.Valid Parentheses
- [LeetCode]20.Valid Parentheses
- 【LEETCODE】20-Valid Parentheses
- LeetCode: Longest Valid Parentheses [031]
- LeetCode题解:Valid Parentheses
- LeetCode:Valid Parentheses
- [leetcode]32. Longest Valid Parentheses(Java)
- LeetCode: Valid Parentheses
- leetcode做题总结,题目Longest Valid Parentheses 2012/02/29
- Valid Parentheses - Leetcode
- leetcode 20. Valid Parentheses
- leetcode 20-Valid Parentheses
- [leetcode]Longest Valid Parentheses
- [leetcode 20] Valid Parentheses