#include "SqListFunc.cpp"
void InputElement(SqList &L)
{
int i,num;
ElemType e;
printf("num= ");
scanf("%d",&num);
printf("Elem= ");
for(i=1;i<=num;i++)
{
scanf("%d",&e);
ListInsert_Sq(L,i,e);
}
}
void purse(SqList &La,SqList &Lb)
{
int La_len=0,Lb_len,i;
Lb_len=ListLength_Sq(Lb);
ElemType e;
for(i=1;i<=Lb_len;i++)
{
ListDelete_Sq(Lb,1,e);
if(!LocateElem_Sq(La,e))
{
ListInsert_Sq(La,++La_len,e);
}
}
}
int main()
{
SqList La,Lb;
printf("*************************输入B*************************\n");
InitList_Sq(Lb);
InputElement(Lb);
InitList_Sq(La);
purse(La,Lb);
printf("*************************输出A****************************");
ListTraverse_Sq(La);
DestroyList_Sq(La);
已知一个非纯集合B,构造一个纯集合A,使集合A只含有B中值各不相同的成员(数据结构)
最新推荐文章于 2021-06-29 14:30:36 发布