顺序表集合操作.doc

/*9、集合操作（分）基本功能要求：（）从文件中读入集合数据建立单链表。（）分别求出集合的交、并、差。*/#include#include#define MaxSize 33typedef int ElemType;typedef structElemType dataMaxSize+1;int length;SqList;void InitList(SqList *&L)/创建空的顺序表L=(SqList *)malloc(sizeof(SqList);L-length=0;void CreateList(SqList *&L)/向数据表输入数据int i=1,n;printf(Please input the data and end up with 0:n);scanf(%d,&n);L-length=0;while(n!=0 & L-length datai=n;i+;L-length+;scanf(%d,&n);int LengthList(SqList *&L)/顺序表长度return(L-length);int GetElem(SqList *L,int i,ElemType &e)/获取顺序表中的一个元素e=L-datai;if(iL-length)return 0;else return 1;int ListInsert(SqList *&L,int i,ElemType e)/在顺序表中i处插入指定元素eint j;if(iL-length+1 | L-length=MaxSize)return 0;for(j=L-length;j=i;j-)L-dataj+1=L-dataj;L-datai=e;L-length+;return 1;void ListDelete(SqList *&L,int i,ElemType &e)/删除相同元素int j;if(iL-length)printf(ERROR!);e=L-datai;for(j=i+1;jlength;j+)L-dataj-1=L-dataj;L-length-;void ClearList(SqList *&L)/清除顺序表中重复元素int i,j,e;for(i=1;ilength;i+)for(j=i+1;jlength;j+)if(L-datai!=L-dataj)continue;elseif(L-datai=L-dataj & jlength)ListDelete(L,j,e);j-;elseif(L-datai=L-dataj & j=L-length)ListDelete(L,j,e);void MergeList(SqList *LA,SqList *LB,SqList *&LC)/求两个集合并集int i=1,j=1,k=0;ElemType ai,bj;int LA_len,LB_len;InitList(LC);LA_len=LengthList(LA);LB_len=LengthList(LB);/*while(i= LA_len) & (j= LB_len)/该段备注加上则为按顺序排开的GetElem(LA, i, ai); GetElem(LB, j, bj); if (ai = bj) ListInsert(LC, +k, ai); +i; else ListInsert(LC, +k, bj); +j; */ while (i = LA_len)/向LC添加元素 GetElem(LA, i+, ai); ListInsert(LC, +k, ai); while (j = LB_len) GetElem(LB, j+, bj); ListInsert(LC, +k, bj); ClearList(LC);/清除重复元素printf(The merged list(without order) is:);/显示并集for(i=1;ilength;i+)printf(%3d,LC-datai);printf(n);void CrossList(SqList *LA,SqList *LB,SqList *&LD)/求两个集合的交集InitList(LD);int i,j,k=0;for(i=1;ilength;i+)for(j=1;jlength;j+)if(LA-datai=LB-dataj)ListInsert(LD,+k,LA-datai);if(LD-length=0)printf(The crossed list is:);/若无相同元素则交集为空printf(空集n);elseprintf(The crossed list is:);/显示交集for(i=1;idatai);printf(n);int LocateElem(SqList *L,ElemType e)/搜索数值相同元素int i=1;while(ilength &L-datai!=e)i+;if(iL-length)return 0;else return i+1;void DifferList(SqList *LA,SqList *LB,SqList *&LE) /求A-B的差集，即A中存在B中不存在的元素int i,k=0;InitList(LE);for(i=1;ilength;i+)if(!LocateElem(LB,LA-datai)/在LB中搜索数值不相同的元素ListInsert(LE,+k,LA-datai);ClearList(LE);printf(The defferd list (A-B) is:);for(i=1;ilength;i+)printf(%3d,LE-datai);printf(n);void main()SqList *LA;SqList *LB;SqList *LC;SqList *LD;SqList *