leetcode - Valid Parentheses
来源：互联网 发布：阿基里斯悖论 知乎 编辑：程序博客网 时间：2024/06/03 17:41
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(std::string s) {std::stack<char> st;for (int i = 0; i < s.size(); i++){if(s[i] == '(' || s[i] == '[' || s[i] == '{') st.push(s[i]);else if(s[i] == ')'){if(st.empty()) return false;if(s[i] == ')' && st.top() == '(')st.pop();elsereturn false;}else if(s[i] == ']'){if(st.empty()) return false;if(s[i] == ']' && st.top() == '[')st.pop();elsereturn false;}else if(s[i] == '}'){if(st.empty()) return false;if(s[i] == '}' && st.top() == '{')st.pop();elsereturn false;}else{return false;}}if(st.empty())return true;elsereturn 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
- codeblocks 终端设置
- HDU 5063 Operation the Sequence（暴力 数学）
- 题目116 士兵杀敌（二）
- leetcode Next Permutation
- 《人工智能（智能系统指南，第二版）》读书笔记——6、第五章
- leetcode - Valid Parentheses
- 动漫推荐之一周的朋友
- 在ubuntu 14.04上解决gedit中文乱码的问题
- 用栈解决括号配对问题
- 【沟通的艺术】你能勾住你的听众么？
- cocos2d-x+lua开发模式下编辑器的选择
- JVM最多能创建多少个线程:unable to create new native thread
- C/C++的一些关于字符数组和指针的小总结
- UEditor的使用
