题目:https://leetcode.com/problems/valid-parentheses/#/description
代码:
class Solution {
public:
bool isValid(string s) {
stack<char> t;
for(int i=0;i<s.size();i++){
if(s[i]=='('||s[i]=='{'||s[i]=='[')
t.push(s[i]);
else{
if(s[i]==')'&&(t.empty()||t.top()!='(')||s[i]=='}'&&(t.empty()||t.top()!='{')||s[i]==']'&&(t.empty()||t.top()!='['))
return false;
else
t.pop();
}
}
return t.empty();
}
};