leetcode之20. Valid Parentheses
2016-10-10 16:39
525 查看
原题:
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.
[b]******************************[/b]我是一条分割线[b]************************[/b]
头文件有一个#include ,是C++自带的栈,用起来还是很方便的。
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.
[b]******************************[/b]我是一条分割线[b]************************[/b]
class Solution { public: bool isValid(string s) { stack<char> sta; for(int i=0;i<s.size();i++) { if(s[i]=='(' || s[i]=='{' || s[i]=='[') sta.push(s[i]); else if (s[i]==')') { if (!sta.empty() &&'('==sta.top()){sta.pop();continue;} else return false; } else if(s[i]=='}') { if(!sta.empty() &&'{'==sta.top() ){sta.pop();continue;} else return false; } else if(s[i]==']') { if(!sta.empty() &&'['==sta.top()){sta.pop();continue;} else return false; } else continue; } if(!sta.empty()) return false; else return true; } };
头文件有一个#include ,是C++自带的栈,用起来还是很方便的。
相关文章推荐
- leetcode 20 Valid Parentheses
- LeetCode 20 Valid Parentheses (C,C++,Java,Python)
- leetCode 20. Valid Parentheses 字符串
- [leetcode] 20. Valid Parentheses
- leetcode 20. Valid Parentheses
- LeetCode 20 — Valid Parentheses(C++ Java Python)
- leetCode 20.Valid Parentheses (有效的括号) 解题思路和方法
- 【LeetCode 20】Valid Parentheses(Python)
- 20. Valid Parentheses leetcode Python 2016 new Season
- leetcode 20-Valid Parentheses
- Leetcode -- 20. Valid Parentheses
- LeetCode 20:Valid Parentheses
- Leetcode 20 Valid Parentheses
- Leetcode:20. Valid Parentheses(JAVA)
- leetcode 20. Valid Parentheses
- leetcode-20-Valid Parentheses
- leetcode20.ValidParentheses
- <LeetCode OJ> 20. Valid Parentheses
- 【LeetCode20】【Valid Parentheses】
- Leetcode 20. Valid Parentheses