leetcode:Valid Parentheses
来源:互联网 发布:ubuntu vs2013 编辑:程序博客网 时间:2024/05/17 06:45
题目描述:
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.
accepted code with c++:
class Solution {public: bool isValid(string s) { stack<char> parenthese; bool flag = true; for(int i = 0;i < s.size(); i++) { if(s[i] == '('||s[i] == '['||s[i] == '{') parenthese.push(s[i]); if(s[i] == ')'||s[i] == ']'||s[i] == '}') { if(!parenthese.empty()) { if(isPair(parenthese.top(),s[i]) ) { parenthese.pop(); } else { flag = false; break; } } else { flag = false; break; } } } if(!parenthese.empty()) flag = false; return flag; } bool isPair(char s1, char s2) { if((s1 == '(' &&s2 == ')') ||(s1 == '[' &&s2 == ']') ||(s1 == '{' &&s2 == '}')) 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
- 经济不独立 思想就不能独立
- JS的trim() startWith() endWith() 方法
- 005 普通位运算
- HLJU 1105 cpc 喵喵的拆分集合 (并查集的逆向操作)
- 文本无关的声纹识别 验证
- leetcode:Valid Parentheses
- MYSQL 查询注册7日内无登陆,随后有登陆操作,连接查询,组查询,AND OR优先级,数据表别名
- 深入浅出MyBatis-Sqlsession
- 单片机:时钟周期,机器周期,指令周期
- tsung 安装和测试注册
- 机器学习中的相似性度量,方法汇总对比
- 区域分割算法
- iOS安全攻防(六)使用class-dump导出Frameworks头文件
- 计算机视觉和模式识别的code