class Solution {
public:
bool isValid(string s) {
stack<char> target;
bool flag=true;
map<char,char> dict={{')','('},{']','['},{'}','{'}};
for(int i=0;i<s.length();++i)
{
if(s[i]=='{'||s[i]=='['||s[i]=='(')
target.push(s[i]);
else if(target.empty()==false&&dict[s[i]]==target.top())
target.pop();
else
{return false;}
}
return target.empty();
}
};
Leetcode第20题笔记
最新推荐文章于 2021-09-29 19:11:03 发布