LeetCode - Valid Parentheses
来源：互联网 发布：linux系统品牌 编辑：程序博客网 时间：2024/05/17 06:16
题目描述：
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.
#include<iostream>#include<string>#include<stack>using namespace std;class Solution {public: bool isValid(string s) {stack<char> x; for(int i=0;i<s.size();i++) { if(x.empty()) x.push(s[i]); else if(s[i]=='{') x.push(s[i]); else if(s[i]=='[') x.push(s[i]); else if(s[i]=='(') x.push(s[i]); else if(s[i]=='}'&&x.top()=='{') x.pop(); else if(s[i]=='}'&&x.top()!='{') return false; else if(s[i]==']'&&x.top()=='[') x.pop(); else if(s[i]==']'&&x.top()!='[') return false; else if(s[i]==')'&&x.top()=='(') x.pop(); else if(s[i]==')'&&x.top()!='(') return false; } if(x.empty()) return true; else return false; }}; 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
- 欢迎使用CSDN-markdown编辑器
- 用简单的方法高效的将pdf转换成word格式
- Alibaba Otter实现扩展导入nosql DB和其它DB
- GB/T 27930-2015
- 关于properties配置文件读写，追加以及中文乱码问题
- LeetCode - Valid Parentheses
- web前端－JavaScript 正则表达式 －019
- Python科学计算环境推荐——Anaconda
- 2016 CCPC 中国大学生程序设计竞赛 合肥赛区 总结
- 给Ubuntu的apt-get设置代理
- 属性动画+snakebar+toast+dialog
- 关键帧的边缘检测
- Leetcode 169 Majority Element
- Netty5用户手册之三：使用netty实现EchoServer程序
