LeetCode : Valid Parentheses
来源:互联网 发布:python 最优化算法包 编辑:程序博客网 时间:2024/09/21 06:33
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>brack; int i = 0; while(i<s.size()) { char c = s[i]; if(c=='('||c=='['||c=='{') brack.push(c); else { if(brack.size()==0) return false; char pre = brack.top(); switch(c) { case ')': if(pre=='(') brack.pop(); else return false; break; case ']': if(pre=='[') brack.pop(); else return false; break; case '}': if(pre=='{') brack.pop(); else return false; break; } } ++i; } if(brack.size()==0) 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
- 机器学习中的逻辑回归
- BZOJ1787: [Ahoi2008]Meet 紧急集合&1832: [AHOI2008]聚会
- Java学习笔记(六)--继承 final关键字 多态 抽象类 接口
- JavaScript初级玩法(2)—输出九九乘法表
- C语言基础 单链表(上)
- LeetCode : Valid Parentheses
- DeepID人脸识别算法之三代
- 杨辉三角
- 程序员面试经典--汉诺塔
- android 仿Listview增删数据
- Rikka with Graph(水题)
- Android学习(5)——小案例(SharedPreference)
- 基于MCS-51内核的汇编操作符笔记
- 数组中两个数异或求最大值