leetcode Valid Parentheses
来源：互联网 发布：opencv读取caffe 编辑：程序博客网 时间：2024/06/06 02:00
代码
class Solution {public: bool isValid(string s) { int length = s.length(); if(length==0) return true; stack<char> brackets; for(int i = 0; i < length; ++i) { if(s[i]=='('||s[i]=='{'||s[i]=='[') brackets.push(s[i]); else { if(brackets.empty()!=0) return false; char temp = brackets.top(); switch(s[i]) { case ']': if(temp !='[') return false; break; case '}': if(temp !='{') return false; break; case ')': if(temp !='(') return false; break; default: break; } brackets.pop(); } } if(brackets.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
- STL系列之十 全排列(百度迅雷笔试题)
- Java中向上转型
- [Win32]键盘接口简介
- android呼叫流程源码分析
- 仿微信公众号界面实现
- leetcode Valid Parentheses
- 10.12-10.25
- 一致性hash算法理解
- Protocol 保护，私有，公有
- 双系统为linux扩容
- 第五天CCTouch详解
- jetty之嵌入式运行jetty
- PHP中静态(static)调用非静态方法详解
- HDU1241广搜
