C 語(yǔ)言實(shí)現(xiàn) 括號(hào)匹配 算法實(shí)例

1、#include<stdio.h>#include<ds.h>#include<malloc.h> typedef char SElemType;typedef struct char rc; char lc; bracket;#include<sqstack.h>main() /* arrayÓÃÀ´´æ´¢Ô­À¨ºÅ£¬nÓÃÀ´±&

2、#237;ʾԭÀ¨ºÅµÄ¶ÔÊý£»string ÓÃÀ´´æ´¢ËùÐèÅжÏÀ¨ºÅµÄÀ¨ºÅ£¬ m±íÊ

3、0;ËùÐèÅжÏÀ¨ºÅµÄµÄ¸öÊý*/ 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:&q

4、uot;); scanf("%d",&n); array=(bracket *)malloc(n*sizeof(bracket); for(i=0;i<n;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); fl

5、ag=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;i<m;i+) flag=1; printf

6、("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) /*À¨ºÅÆ¥ÅäµÄÖ÷ÒªµÄ

7、8;¿·Ö*/ for(i=0;i<m;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 *

8、a,char b,int n)/* ÅжÏ×Ö·ûbÊDz»ÊÇaµÄ×óÀ¨ºÅ*/ int i,k=0; for(i=0;i<n;i+) if(ai.lc=b) k=i+1;break; return (k); int bdunrc(bracket *a,char b,int n)/* ÅжÏ×Ö

9、3;ûbÊDz»ÊÇaµÄÓÒÀ¨ºÅ*/ int i,k=0; for(i=0;i<n;i+) if(ai.rc=b) k=i+1;break; return k;/*sqstack.h Îļþ*/typedef struct SElemType *base; SElemType *top; int StackSize; sqstack;int InitStack(sqstack *s) int

10、n; printf("please input the size of sqstack:"); scanf("%d",&n); printf("n"); s->base=(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) retu

11、rn 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;

12、 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

13、(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<