维护一个栈,然后……
class Solution {
public:
bool isValid(string s) {
vector<int> A;
for (auto x : s) {
switch (x) {
case '(':
A.push_back(x);
break;
case ')':
if (A.empty() || A.back() != '(') return false;
A.pop_back();
break;
case '[':
A.push_back(x);
break;
case ']':
if (A.empty() || A.back() != '[') return false;
A.pop_back();
break;
case '{':
A.push_back(x);
break;
case '}':
if (A.empty() || A.back() != '{') return false;
A.pop_back();
break;
default:
break;
}
}
if (!A.empty()) return false;
return true;
}
};