Leetcode [Valid Parentheses]
来源:互联网 发布:ubuntu资源监视器 编辑:程序博客网 时间:2024/06/05 06:56
Problem : Valid Parentheses
Question
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.
思路
直接用栈解决。比较简单
代码
class Solution {public: bool isValid(string s) { stack<char> p; for(int i = 0; i < s.size(); i++) { if(s[i] == '(' || s[i] == '{' || s[i] == '[') { p.push(s[i]); } else { if (s[i] == ')') { if (p.size() != 0 && p.top() == '(') p.pop(); else return false; } if (s[i] == ']') { if (p.size() != 0 && p.top() == '[') p.pop(); else return false; } if (s[i] == '}') { if (p.size() != 0 && p.top() == '{') p.pop(); else return false; } } } if (p.size() != 0) return false; return true; }};
阅读全文
0 0
- LeetCode: Valid Parentheses
- LeetCode: Longest Valid Parentheses
- LeetCode: Valid Parentheses
- LeetCode Longest Valid Parentheses
- [Leetcode] Valid Parentheses
- LeetCode: Longest Valid Parentheses
- [Leetcode] Longest Valid Parentheses
- LeetCode : Valid Parentheses
- [leetcode]longest Valid Parentheses(!!)
- Leetcode: Valid Parentheses
- leetcode 52: valid parentheses
- [Leetcode] Longest Valid Parentheses
- leetcode Longest Valid Parentheses
- 【leetcode】Valid Parentheses
- 【leetcode】Longest Valid Parentheses
- [LeetCode]Longest Valid Parentheses
- [LeetCode]Valid Parentheses
- LeetCode-Valid Parentheses
- frame 嵌套页面定位元素方法
- CAD工程图纸转jpg格式教程
- 设计模式小记(一)
- 算法竞赛入门经典(第2版)-刘汝佳-第八章例题解题源码(C++语言)(部分)
- 14 外连接(hash join outer)--优化主题系列
- Leetcode [Valid Parentheses]
- Jetty Tomcat
- DBCP与C3P0
- 微信退款结果通知
- tensorboard
- Shell脚本里面 $#, $@的含义
- Azure Linux 虚拟机常见导致无法远程的操作
- C++类中的指针成员和拷贝构造函数
- gcc