入栈与出栈的所排列可能性.docVIP

#include stdio.h#include stdlib.h#include bios.h#include string.h#include graphics.h/*定义全局变量*/int pu=0,po=0,t=0;char tp[130][12]; /*用栈排出入栈出栈的顺序*/struct train{? int numb;? struct train *next;? }; struct push{? int a;? int b;? char data[24];? struct push *next;? }; struct push *creat(struct push *top){? top=(struct push *)malloc(sizeof(struct push));? top-next=NULL;? return top;} struct push *pup(struct push *top,int a,int b,int n){? struct push *p,*q;? q=top-next;? p=(struct push *)malloc(sizeof(struct push));? p-a=a;? p-b=b;? if(q)??? strcpy(p-data,q-data);? if(q-an||!q)?? {??? p-data[a+b-1]=r;??? p-data[a+b]=\0;?? }? else?? {???? p-data[a+b-1]=c;???? p-data[a+b]=\0;?? }? p-next=top-next;? top-next=p;return top;} struct push *pop(struct push *top){? top=top-next;? return top;} struct push *apaili(struct push *top,int numb)? /*向后移动一个出命令*/{? struct push *q;? q=top-next;? if(punumb)?? {???? pu++;???? top=pup(top,pu,po,numb);???? top=apaili(top,numb);??? }?? if(ponumb)??? {????? po++;????? top=pup(top,pu,po,numb);????? top=apaili(top,numb);???? }???? return top;} struct push *bpaili(struct push *top,int numb) /*移动第一个出命令到最后*/{? int a,b,cir;? char x[22];? struct push *p;???? do{? p=top-next;? p=p-next;? a=p-a;? b=p-b;? if(p-data[a+b-1]==r)? break;? else? {? do{????? top=pop(top);????? p=top-next;????? a=p-a;????? b=p-b;??? }while(p-data[a+b-1]==c);? if(a==1)??? {????? cir=1;????? break;????? }? top=pop(top);? a--;? b++;? top=pup(top,a,b,numb);? top-next-data[a+b-1]=c;? pu=a;? po=b;? top=apaili(top,numb);? strcpy(x,top-next-data);? if(jc(x))? {??? strcpy(tp[t],x);??? t++;? }? }???? }while(a+b2*numb);???? if(cir==1)???? return top;???? top=pop(top);???? top=bpaili(top,numb); } int jc(char c[22]){? int i=0,k=0;? if(c[i]!=0)? do{???? if(c[i]==r)???? k++;???? if(c[i]==c)???? k--;???? if(k0)???? return 0;???? i++;???? }while(c[i]!=\0);???? return 1;} /*调用排