您的位置:首页 > 其它

leetcode-20-Valid Parentheses

2015-07-26 21:17 483 查看
Valid Parentheses

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>a;
int n = s.size();
for (int i = 0;i < n;i++) {
if (s[i] == '(' || s[i] == '{' || s[i] == '[') {
a.push(s[i]);
}
else if (s[i] == ')' || s[i] == '}' || s[i] == ']') {
if (a.empty()) return false;
if (s[i] == ')' && a.top() == '(') { a.pop();  continue; }
if (s[i] == '}' && a.top() == '{') { a.pop();  continue; }
if (s[i] == ']' && a.top() == '[') { a.pop();  continue; }
return false;
}
}
if (a.empty()) return true;
else return false;
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: