[leetcode刷题系列]Valid Parentheses
2013-08-02 22:00
246 查看
简单题,利用stack模拟就好了,如果最近的两个是一对,我们就把它们消掉,否则就把最新的放到stack去。最后看stack是否为空。
class Solution { public: bool valid(char left, char right){ if(left == '(' && right == ')') return true; if(left == '[' && right == ']') return true; if(left == '{' && right == '}') return true; return false; } bool isValid(string s) { // Start typing your C/C++ solution below // DO NOT write int main() function stack<char> stk; for(int i = 0; i < s.size(); ++ i){ char c = s[i]; if((!stk.empty()) && valid(stk.top(), c)){ stk.pop(); }else stk.push(c); } return stk.empty(); } };
相关文章推荐
- [leetcode刷题系列]Longest Valid Parentheses
- 【leetcode系列】Valid Parentheses
- LeetCode 笔记系列八 Longest Valid Parentheses [lich你又想多了]
- 【leetcode系列】Valid Parentheses
- leetcode_c++:栈:Valid Parentheses(020)
- LeetCode Valid Parentheses
- leetcode 32 : Longest Valid Parentheses
- leetcode:Longest Valid Parentheses 使用动态规划O(n)思路
- leetcode第12题----- Valid Parentheses
- 【LeetCode with Python】 Valid Parentheses
- LeetCode_Stack_Valid Parentheses
- leetcode 20 Valid Parentheses 括号匹配
- leetcode:Longest Valid Parentheses
- leetcode(20). Valid Parentheses
- 【leetcode】【20】Valid Parentheses
- Leetcode235: Longest Valid Parentheses
- Leetcode题解14 20. Valid Parentheses
- leetcode:Longest Valid Parentheses
- leetcode 日经贴,python code -Valid Parentheses
- LeetCode 20. Valid Parentheses