数据结构结合求并.docVIP

数据结构结合求并 说明：分别用两个线性表对集合进行表示，将其中一个集合并到另一个集合。 程序如下（C＋＋/VC环境） #define INITSIZE 10 #define INCREASEMENT 2 #define OVERFLOW -1 #define OK 1 #define ERROR 0 #define TRUE 1 #define FALSE 0 #include iostream.h #includestdio.h #includestdlib.h #includemalloc.h typedef int Status; typedef char ElemType; typedef struct{ ElemType *elem; int length; int listsize; }SqList; Status InitList(SqList L){ L.elem=(ElemType *)malloc(INITSIZE*sizeof(ElemType)); if(!L.elem) exit(OVERFLOW); L.length=0; L.listsize=INITSIZE; return OK; }//InitList Status ListInsert(SqList L,int i,ElemType e){ if(L.length=L.listsize){ L.elem=(ElemType *)realloc(L.elem,(L.listsize+INCREASEMENT)*sizeof(ElemType)); if(!L.elem)exit(OVERFLOW); L.listsize=L.listsize+INCREASEMENT; } L.elem[i]=e; L.length++; return OK; }//ListInsert Status CreateList(SqList L){ ElemType e; cine; while(e!=!) { L.elem[L.length++]=e; cine; } return OK; }//CreateList Status GetElem(SqList L,int i,ElemType e){ if(i1||iL.length) return ERROR; e=L.elem[i-1]; return OK; } Status equal(ElemType a,ElemType b){ if(a==b) return TRUE; else return ERROR; }//equal Status ElemLocate(SqList L,ElemType e,Status (*compare)(ElemType,ElemType)){ int i; for(i=1;i=L.length;i++) if((*compare)(e,L.elem[i-1])) return TRUE; return ERROR; }//ElemLocate void Union(SqList La,SqList Lb,SqList Lc){ int i,j,k; i=j=k=0; ElemType a,b; while(iLa.length){ GetElem(La,i+1,a); i++; ListInsert(Lc,k++,a); } while(jLb.length){ GetElem(Lb,j+1,b); j++; if(!(ElemLocate(La,b,equal))) ListInsert(Lc,k++,b); } return; } void main(void){ SqList La,Lb,Lc; InitList(La); InitList(Lb); InitList(Lc); coutPlease Create List A:\n; CreateList(La); coutShow the end A:\n; int i; for(i=0;iLa.length;i++) coutLa.elem[i] ; cout\n; coutPlease Create List B:\n; CreateList(Lb); coutShow the end B:\n; for(i=0;iLb.length;i++) coutLb.elem[i] ; cout\n; Union(La,Lb,Lc); coutShow the end C:\n; for(i=0;iLc.leng