leetcode 52: valid parentheses
2013-01-25 05:00
513 查看
Valid ParenthesesJan
30 '12
Given a string containing just the characters
determine if the input string is valid.
The brackets must close in the correct order,
all valid but
not.
30 '12
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) { // Start typing your C/C++ solution below // DO NOT write int main() function stack<char> myStack; char c; for( int i=0; i<s.size(); i++) { if( s[i] == '(' || s[i] == '[' || s[i] == '{') { myStack.push( s[i] ); } else if( myStack.empty() ) { return false; } else if( s[i] == ')') { c = myStack.top(); if( c!= '(' ) return false; else myStack.pop(); } else if( s[i] == ']') { c = myStack.top(); if( c!= '[' ) return false; else myStack.pop(); } else if( s[i] == '}') { c = myStack.top(); if( c!= '{' ) return false; else myStack.pop(); } else { return false; } } return myStack.empty(); } };
相关文章推荐
- leetcode 52: valid parentheses
- leetcode: Longest Valid Parentheses
- Leetcode Valid Parentheses
- 个人记录-LeetCode 32. Longest Valid Parentheses
- leetcode-java-20. Valid Parentheses
- LeetCode Valid Parentheses 有效括号
- 【LeetCode】20. Valid Parentheses
- leetcode:Longest Valid Parentheses 使用动态规划O(n)思路
- Leetcode c语言-Valid Parentheses
- Leetcode #32 Longest Valid Parentheses
- Leetcode: Valid Parentheses
- leetcode:Longest Valid Parentheses
- 【LeetCode】20. Valid Parentheses
- leetcode: 32. Longest Valid Parentheses [✗]
- LeetCode Valid Parentheses
- LeetCode--20. Valid Parentheses
- leetcode Longest Valid Parentheses O(n)解法
- LeetCode Longest Valid Parentheses
- LeetCode(20) Valid Parentheses
- 【Leetcode】之Longest Valid Parentheses