leetcode---Valid Parentheses
来源：互联网 发布：算命软件破解版 编辑：程序博客网 时间：2024/06/10 20: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.
class Solution {public: bool isValid(string s) { stack<char> sk; int len = s.length(); if(len == 1) return false; for(int i=0; i<len; i++) { if(s[i] == '(' || s[i] == '[' || s[i] == '{') sk.push(s[i]); else if(s[i] == ')') if(sk.size() ==0) return false; else if(sk.top() != '(') return false; else sk.pop(); else if(s[i] == ']') if(sk.size() ==0) return false; else if(sk.top() != '[') return false; else sk.pop(); else if(s[i] == '}') if(sk.size() ==0) return false; else if(sk.top() != '{') return false; else sk.pop(); } if(sk.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
- 扩展的欧几里德算法的学习
- 当Gerrit的Cubmit类型为cherry pick时的工作方式
- 1007. 素数对猜想 (20)
- tableView的代理方法中cell的按下和离开
- 使用complex容器类处理复数数据
- leetcode---Valid Parentheses
- FlowLayout布局
- opengl VS环境配置
- 实践--课程表（ViewPager实现）
- The C programing language 第一章
- 深度学习，自然语言处理，表达Deep Learning, NLP, and Representations
- java.sql.SQLException: Access denied for user
- python 调用C++模块 visual studio版
- 分数类雏形
