栈的简单应用

#include<iostream> #include<stack> #include<cstdio> using namespace std; stack<char> q; int main() { int n; char m; while(scanf("%d",&n)!=EOF) { char ch; ch=getchar(); // printf("xxx%cxxx",ch); while(n--) { while(!q.empty())q.pop(); m=getchar(); // printf("xxx%cxxx",m); while(m!='\n') { // printf("xxx%cxxx",m); if(q.empty()) { q.push(m); m=getchar(); continue; } if((m==')'&&q.top()=='(')||(m==']'&&q.top()=='[')) q.pop(); else q.push(m); m=getchar(); } if(q.empty()) printf("Yes\n"); else printf("No\n"); } } }