stack<elem>c 创建一个空的stack
stack<elem>c1(c2) 复制stack
c.top() 返回栈顶数据
c.push(elem) 在栈顶增加elem数据
c.pop()弹出栈顶数据
c.empty() 判断栈是否为空
c.size() 返回栈中数据的个数
#include<iostream>
#include<cstring>#include<stack>
using namespace std;
char s[10005];
int main()
{
int n;
cin>>n;
while(n--)
{
int len,i;
stack<char>c;
cin>>s;
len = strlen(s);
for(int i=0;i<len;i++)
{
if(c.empty())
c.push(s[i]);
else
{
if((s[i]==')'&&c.top()=='(')||(s[i]==']'&&c.top()=='[')||(s[i]=='>'&&c.top()=='<')||(s[i]=='}'&&c.top()=='{'))
c.pop();
else
c.push(s[i]);
}
}
if(!c.empty())
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
}
return 0;
}