集合 的交并和差的运算与实现

ftinclude<malloc.h>#include<stdio.h>Sinclude<stdlib.h>#include<conio.h>#includc<iostream.h>Sinclude<string.h>//顺序表定义^defineTRUE1ttdefineFALSE0SdefineOK1SdefineERROR0^defineOVERFLOW-2#defineIN_TH1S_LIST1#defineNOT_IN_THIS_LIST0〃宏定义typedefcharElemtype;typedefintStatus;typedefstructListwhile(P)if(P->data==e)returnINTHISLIST;P=P->next;)returnNOT」N_THIS_LIST;)〃判定函数Statusziji(LinkListLa,LinkListLb)(LinkListPb=Lb->next;while(Pb)(if(!compare(La,Pb->data))returnFALSE;Pb=Pb->next;)returnTRUE;Statusmenu(LinkListA,LinkListB)inti;do{system(〃cls〃)；cout<<"******集合的计算*****\n";cout<<“*<1>:输入集合信息*\n〃;cout«"*<2>:输出交集信息*\n〃；cout«，/*<3>:输出差集信息*\n〃；cout«，z*<4>:输出并集信息*\n〃；cout«，/*<5>:判定是否子集*\n〃；cout<<"*<6>:输出补集信息*\n";cout<<〃*<0>:退出管理系统*\n〃；cout<X"*******程尧制作*******\n〃;cout<〈”请选择操作(1-6):〃;cin>>i;if(A->next&&B->next){cout<<"集合A:〃;PrintList(A);cout<<"集合B:";PrintList(B);}}while(i<0||i>6);returni;}intmain(){LinkListA;InitList(A);LinkListB;InitList(B);LinkListJ;InitList(J);LinkListK;InitList(K);LinkListL;InitList(L);LinkListM;InitList(M);Elemtypea;继续阅读Elemtypedata;structList*next;}LNodc,*LinkList;//结构体定义StatusInitList(LinkList&L){L=(LinkList)malloc(sizeof(LNode));if(!L)exit(OVERFLOW);L->data=NULL;L->next=NULL;returnOK;)〃构造表头StatusPrintList(LinkListL)(LinkListPrintList=L->next;if(!L->next){cout<<〃该集合为空！“<Xendl;returnERROR;}while(PrintList->next)cout«PrintList->data<</，,PrintList=PrintList->next;)cout<<PrintList->data;cout«endl;returnOK;}〃输出表中元素StatusInsertList(LinkList&L,Elemtypee){if((int)e<97||(int)e>122)returnERROR;LinkListcompare=(LinkList)malloc(sizeof(LNode));LinkListinsertdata=(LinkList)malloc(sizeof(LNode));compare二L;while(compare->next){if(e==coniparc->ncxt->data)returnTRUE;elseif(e<(compare->next->data))insertdata->next=compare->next;insertdata->data=e;comparc->ncxt=inscrtdata;returnOK;)compare=comparc->next;)insertdata->data=e;compare->ncxt=insertdata;insertdata->next=NULL;returnOK;}〃向表中增加元素StatusDeleteList_data(LinkList&L,Elemtypee){LinkListDclctcclata=L->ncxt;while(Deletedata->next)if(!(Deletedata->next->next)&&(Deletedata->next->data-e)){Deletedata->next=NULL;returnOK;}if(Dclctcdata->ncxt->data==c){Deletedata->next=Deletedata->next->next;returnOK;)Deletedata=Deletedata->next;)Deletedata=L->next;if(Deletedata->data-e)(L->next=Deletedata->next;returnOK;)returnERROR;Statusjiaoji(LinkListLa,LinkListLb,LinkList&L)LinkListPa=La->next;LinkListPb=Lb->next;while(Pa){while(Pb){if(Pb->data-Pa->data)InsertList(L,Pa->data);Pb=Pb->next;)Pb=Lb->next;Pa=Pa->next;)returnOK;)〃求交集函数Statuschaji(LinkListLa,LinkListLb,LinkList&L)Statuscompare=0;LinkListPa,Pb;Pa=La->ncxt;Pb=Lb->next;while(Pa)(while(Pb){if(Pa->data==Pb->data)compare++;Pb=Pb->next;)if(!compare)InsertList(L,Pa->data);compare=0;Pb=Lb->next;Pa=Pa->ncxt;)returnOK;)〃差集函数Statusbingji(LinkListLa,LinkListLb,LinkList&L){LinkListPa=La->next;LinkListPb=Lb->next;while(Pa){InsertList(L,Pa->data);Pa=Pa->next;}while(Pb){InsertList(L,Pb->data);Pb=Pb->next;}returnOK;)〃并集函数Statusbuji(LinkListL,LinkList&List){Statusset=97;while(set<=122){InsertList(List,(Elemtype)set);set++;)LinkListPL=L->next;LinkListP=List->next;while(PL)