C 语言实现 括号匹配 算法实例.doc

#include#include#include typedef char SElemType;typedef struct char rc; char lc; bracket;#includemain() /* arraynstring m*/ int i,n,m,t,flag; sqstack s; int bdunrc(bracket *a,char b,int n); int bdunlc(bracket *a,char b,int n); char *string,e; bracket *array; printf(plase input array number:); scanf(%d,&n); array=(bracket *)malloc(n*sizeof(bracket); for(i=0;in;i+) flag=1; printf(plese input the %dth couple of array:,i+1); scanf(%c,&arrayi.lc); e=arrayi.lc; while(e=n & flag=1) scanf(%c,&arrayi.lc); flag=0; scanf(%c,&arrayi.rc); flag=1; e=arrayi.rc; while(e=n & flag=1) scanf(%c,&arrayi.rc); flag=0; printf(please input backet crouse:); scanf(%d,&m); string=(char *)malloc(n*sizeof(char); for(i=0;im;i+) flag=1; printf(plese input the %dth sting:,i+1); scanf(%c,&stringi); e=stringi; while(e=n & flag=1) scanf(%c,&stringi); flag=0; if(InitStack(&s) /*/ for(i=0;im;i+) t=bdunrc(array,stringi,n); if(t) if(*(s.top-1)=arrayt-1.lc) Pop(&s,&e); else Push(&s,stringi); if(StackEmpty(s) printf(OKn); else printf( n); int bdunlc(bracket *a,char b,int n)/* ba*/ int i,k=0; for(i=0;in;i+) if(ai.lc=b) k=i+1;break; return (k); int bdunrc(bracket *a,char b,int n)/* ba*/ int i,k=0; for(i=0;ibase=(SElemType *)malloc(n*sizeof(SElemType); if(!s-base) return error; s-top=s-base; s-StackSize=n; return OK;int GetTop(sqstack s,SElemType *e) if(s.top=s.base) return error; *e=*(s.top-1); return OK;int Push(sqstack *s,SElemType e) if(s-top-s-base=(s-StackSize)-1) s-base=(SElemType *)realloc(s-base,(s-StackSize+10)*sizeof(SElemType); if(!s-base) return error; s-StackSize+=10; s-top=s-base+s-StackSize; *(s-top)=e; s-top+; return OK;int Pop (sqstack *s,SElemType *e)if(s-top=s-base) return error;s-top-;*e=*(s-top);return OK;int DestroyStack(sqstack *s)free(s-top);free(s-base);free(&(s-StackSize);return OK;int ClearStack(sqstack *s)if(s-base=s-top) return OK;else free(s-base); free(s-top); s-base=(SElemType *)malloc(s-StackSize*sizeof(SElemType); if(!s-base) return error; s-top=s-base; return OK; int StackEmpty(sqstack s)if(s.base=s.top) return OK;else return Flase;int StackLength(sqstack s) if(!(&s) return error; else return s.top-s.base;/* int StackTraverse(stack s,(SElemType *)vist(SElemType e)int i,n; n=s.top-s.base; for(i=0;i=n)return