class Solution {
public:
bool isValid(string s) {
int n = s.size();
if (n <= 1) {
return false;
}
stack<char> stk;
for (int i =0; i < n; ++i) {
if (s[i] == '(' or s[i] == '[' or s[i] == '{') {
stk.push(s[i]);
}
else if (stk.empty()) {
return false;
}
else {
if ((stk.top() == '(' and s[i] == ')') or
(stk.top() == '[' and s[i] == ']') or
(stk.top() == '{' and s[i] == '}')) {
stk.pop();
}
else {
return false;
}
}
}
return stk.empty()?true:false;
}
};
20.有效的括号
最新推荐文章于 2024-07-15 12:10:21 发布