Leetcode 20. Valid Parentheses (Easy) (cpp)
来源：互联网 发布：大连育知同创科技 编辑：程序博客网 时间：2024/05/21 11:01
Leetcode 20. Valid Parentheses (Easy) (cpp)
Tag: Stack, String
Difficulty: Easy
/*20. Valid Parentheses (Easy)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> str;for (int i = 0; i < s.length(); i++) {if (s[i] == '(' || s[i] == '{' || s[i] == '[') {str.push(s[i]);}else {if (str.empty()) return false;if ((s[i] == ')' && str.top() != '(') || (s[i] == '}' && str.top() != '{') || (s[i] == ']' && str.top() != '[')) return false;str.pop();}}return str.empty();}};
0 0
- Leetcode 20. Valid Parentheses (Easy) (cpp)
- 【leetcode】Valid Parentheses(easy)
- 20. Valid Parentheses (Easy)
- [Leetcode 20, Easy] Valid Parentheses
- 【Leetcode-Easy-20】 Valid Parentheses
- LeetCode-Easy部分中标签为String 20. Valid Parentheses
- 20. Valid Parentheses [easy] (Python)
- 20.Valid Parentheses(Stack-Easy)
- LeetCode-20-Valid Parentheses(堆栈)-Easy
- LeetCode OJ 20 Valid Parentheses [Easy]
- LeetCode-Easy刷题(5) Valid Parentheses
- leetcode 日经贴，Cpp code -Valid Parentheses
- Leetcode 32. Longest Valid Parentheses (Hard) (cpp)
- LeetCode 20. Valid Parentheses
- [LeetCode] 20.Valid Parentheses
- LeetCode --- 20. Valid Parentheses
- LeetCode 20.Valid Parentheses
- [Leetcode] 20. Valid Parentheses
- prctl()函数应用
- linux文本处理三剑客（一）：grep命令详解
- ScheduleThreadPoolExecutor源码分析（二）
- Glide
- Java并发编程基础
- Leetcode 20. Valid Parentheses (Easy) (cpp)
- 如何理解Struts和Spring单例和多例，以及Action请求的问题
- Java对Redis的基本操作
- Eclipse debug模式下使用16进制(Hex)查看变量值
- 搭建基于SSH的Git服务器
- IOS开发中（null）与<null>的处理
- ACM知识点 之 贪心（4）部分背包问题
- Debian8下python3和python2同时安装如何使用pip
- shp文件保存到mysql
