**
括号匹配算法(栈)
**
对于括号匹配问题的代码如下:
#include<iostream>
#include<malloc.h>
using namespace std;
#define MaxSize 10010
typedef char ElemType;
ElemType e;
typedef struct //定义栈
{
ElemType data[MaxSize];
int top;
}SqStack;
void InitStack(SqStack *&s) //初始化栈函数
{
s=(SqStack * )malloc(sizeof(SqStack));
s->top=-1;
}
bool Push(SqStack *&s,ElemType e) //进栈函数
{
if(s->top==MaxSize-1)
return false;
s->top++;
s->data[s->top]=e;
return true;
}
bool Pop(SqStack *&s,ElemType &e) //出栈函数
{
if(s->top==-1)
return false;
e=s->data[s->top];
s->top--;
return true;
}
bool StackEmpty(SqStack *s) //判断栈是否为空函数
{
return (s->top==-1);
}
int main()
{
int t,z;
cin>>t;
string str;
while(t--)
{
z=1;
cin>>str;
SqStack *s; //定义一个栈
InitStack(s); //初始化栈
for(int i=0;str[i]!='\0';i++)
{
if(str[i]=='('||str[i]=='[') //若是‘(’或‘[’,则进栈,继续循环
{
Push(s,str[i]);
continue;
}
if(StackEmpty(s)) //若是‘)’或‘]’,并且此时栈为空,则该字符串一定不匹配,用中间变量z标记
{
z=0;
break;
}
Pop(s,e); //若栈不为空,则弹出栈顶元素
if((e=='('&&str[i]==')')||(e=='['&&str[i]==']')) //如果匹配,则继续循环
continue;
else //否则的话,跳出循环并把z标记成0
{
z=0;
break;
}
}
if(z==1&&StackEmpty(s)) //如果z为1并且该栈为空栈,则该字符串匹配
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
return 0;
}