LeetCode(20)-Valid Parentheses
来源:互联网 发布:去网络代理商工作好吗 编辑:程序博客网 时间:2024/06/10 23:18
问题描述:
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> stk; int len = s.length(); for(int i = 0; i < len; i++){ if(s[i] == '[' || s[i] == '{' || s[i] == '(' ){ stk.push(s[i]); } else{ if(stk.empty()) return false; if(stk.top() == '[' && s[i] == ']') stk.pop(); else if(stk.top() == '{' && s[i] == '}') stk.pop(); else if(stk.top() == '(' && s[i] == ')') stk.pop(); else return false; } } return stk.empty(); }};
0 0
- LeetCode 20: Valid Parentheses
- LeetCode(20) Valid Parentheses
- leetcode 20 Valid Parentheses
- Leetcode【20】:Valid Parentheses
- leetcode 20-Valid Parentheses
- [leetcode 20] Valid Parentheses
- [Leetcode] 20 - Valid Parentheses
- LeetCode | #20 Valid Parentheses
- leetcode.20-----------Valid Parentheses
- [leetcode] 20 Valid Parentheses
- leetcode-20 Valid Parentheses
- leetCode #20 Valid Parentheses
- leetcode 20 Valid Parentheses
- Leetcode 20 Valid Parentheses
- LeetCode 20 - Valid Parentheses
- LeetCode 20: Valid Parentheses
- leetcode-20 Valid Parentheses
- leetcode 20 -- Valid Parentheses
- 你不再能自称是小白
- OC基础之对象归档与读取文件
- 扇区 物理块 逻辑块 flash 基础概念【网络收集】
- Android 近百个项目的源代码,覆盖Android开发的每个领域
- Pull解析XML
- LeetCode(20)-Valid Parentheses
- Linux前台、后台、挂起、退出、查看命令汇总
- 霸道厨男出世传记一懒人版糖醋排骨
- 暴力搜索求0--9全排列的第n个
- OC基础之KVC,KVO
- Linux下查看Java进程的运行期间堆栈情况
- duilib 界面库 实现timer定时器
- android mvp快速开发框架介绍(dileber的简介)
- 输入一个集合,求集合内最大乘积