/*
功能:判断一段字符串中(),【】,{},的匹配情况!
日期:2010年4月20号
作者:鲍志强
*/
#include <iostream>
using namespace std;
typedef struct stack{
char c;
stack *next;
}stack;
//进栈操作
void Push(stack *s,char ch)
{
stack *p=new stack();
p->c =ch;
p->next =s->next ;
s->next =p;
}
//判断栈是否为空
bool isempty(stack s)
{
if(s.next ==NULL)
return true;
else
return false;
}
//出栈
char Pop(stack *s)
{
char cha=NULL;
if(isempty(*s))
exit(0);
stack *q;
q=s->next ;
s->next =q->next ;
cha=q->c ;
delete(q);
return cha;
}
int main()
{
char str[6]={'[',']','(','{','}',')'};
//str[20];
stack *s=new stack();
s->next =NULL;
int i=0;
for(int j=0;j<6;j++)
cout<<str[j];
while(i<6)
{
if(str[i]=='('||str[i]=='['||str[i]=='{')
{
Push(s,str[i]);
}
if(str[i]==')')
{
if(s->next ->c!='(')
{
cout<<"不匹配!"<<endl;
exit(0);
}else
{
Pop(s);
}
}else if (str[i]==']')
{
if(s->next ->c!='[')
{
cout<<"不匹配!"<<endl;
exit(0);
}
else
{Pop(s);}
}else if(str[i]=='}')
{
if(s->next ->c!='{')
{
cout<<"不匹配!"<<endl;
exit(0);
}
else
Pop(s);
}else if(str[i]&&isempty(*s))
{
cout<<"不匹配!"<<endl;
exit(0);
}
i++;
cout<<"fjkldsjfljslfkjs"<<endl;
}
if(s->next==NULL)
cout<<"匹配!!!"<<endl;
else
cout<<"不匹配!"<<endl;
return 0;
}