李瑶瑶

 1 //2、栈
 2 #include<iostream>
 3 #include<string.h>
 4 using namespace std;
 5 char s[1005];
 6 char stack[1005];
 7 int main(){
 8     int n;
 9     cin>>n;
10     while(n--){
11         int len,top=1;
12         cin>>s;
13         len=strlen(s);
14         stack[top]=s[0];
15         top++;
16         for(int i=1;i<len;i++){
17             if(s[i]==‘{‘||s[i]==‘(‘){
18                 stack[top++]=s[i];
19             }
20             else{
21                 if(stack[top-1]==‘{‘&&s[i]==‘}‘)
22                     top--;
23                 else if(stack[top-1]==‘(‘&&s[i]==‘)‘)
24                     top--;
25                 else
26                     stack[top++]=s[i];
27             }
28         }
29         if(top==1)
30             cout<<"Yes"<<endl;
31         else
32             cout<<"No"<<endl;
33     }
34     return 0;
35 }