您的位置:首页 > 其它

【LeetCode】20 - Valid Parentheses

2015-09-09 21:05 267 查看
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.

Tags: Stack String

Solution:

class Solution {
public:
bool isValid(string s) {
stack<char> stk;
for(int i=0;i<s.size();i++){
char c=s[i];
if(c=='('||c=='['||c=='{'){
stk.push(c);
}else if(c==')'||c=='}'||c==']'){
if(stk.empty())return false;
else{
char c2=stk.top();
stk.pop();
if((c2=='('&&c!=')')||(c2=='{'&&c!='}')||(c2=='['&&c!=']'))return false;
}
}
}
return stk.empty();
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: