文章
27
粉丝
0
获赞
80
访问
2.4k
#include <iostream>
#include <stack>
using namespace std;
bool isMatch(char left,char right){
return left=='{'&&right=='}'||
left=='['&&right==']'||left=='<'&&right=='>'
||left=='('&&right==')';
}
int main(){
string str;
cin>>str;
stack<char> sta;
for(char c:str){
if(c=='('||c=='['||c=='<'||c=='{')sta.push(c);
else {
if(sta.empty()||!isMatch(sta.top(),c)){
cout<<"no";
return 0;
}
sta.pop();
}
}
if(sta.empty())cout<<"yes";
else cout<<"no";
return 0;
}
登录后发布评论
暂无评论,来抢沙发