假设以两个元素依值递增有序排列的顺序表A和B 分别表示两个集合(同一表中的元素值各不相同),现要求另辟空间构成一个顺序表C,其元素为A和B元素的交集,且表C中的元素也是依值递增有序排列。
# include <stdio.h>
# include <stdlib.h>
# define initsize 20
# define LISTINCREMENT 5
typedef int ElemType;
typedef struct
{
ElemType * elem;
int length;
int listsize;
}SqList;
void IntiList(SqList &L,int n)
{
ElemType *p;
L.elem = (ElemType *)malloc(initsize*sizeof(ElemType));
if(!L.elem)
{
printf("分配失败");
}
printf("请依次输入顺序表的元素(数据元素依值递增):\n");
for(p = L.elem;p < L.elem+n;p++)
{
scanf("%d",p);
}
L.length = n;
L.listsize = initsize;
}
void PrintList(SqList L)
{
ElemType *p;
printf("输出顺序表中的元素\n");
for(p=L.elem;p<L.elem+L.length;p++)
{
printf("%d\t",*p);
}
printf("\n");
}
void IntiList_NULL(SqList &L)
{
L.elem = (ElemType *)malloc(initsize*sizeof(ElemType));
if(!L.elem)
{
printf("分配失败");
}
L.length = 0;
L.listsize = initsize;
}
void ListInsert(SqList &L,int i,ElemType e)
{
ElemType *p,*q,*newbase;
q=L.elem+i-1;
if(i<1||i>L.length+1)
{
printf("插入元素位置不合法\n");
}
if(L.length>=L.listsize)
{
newbase=(ElemType *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType));
if(!newbase)
{
printf("分配失败");
}
L.elem=newbase;
L.listsize+=LISTINCREMENT;
}
for(p=L.elem+L.length-1;p>=q;p--)
{
*(p+1)=*p;
}
*q=e;
++L.length;
}
void find_intersection(SqList La,SqList Lb,SqList &Lc)
{
int i=0;
ElemType *pa,*pb;
for(pa=La.elem;pa<La.elem+La.length;pa++)
{
for(pb=Lb.elem;pb<Lb.elem+Lb.length;pb++)
{
if(*pb==*pa)
{
i++;
ListInsert(Lc,i,*pa);
}
}
}
}
int main()
{
int n1,n2;
SqList La,Lb,Lc;
printf("请输入要建立的顺序表La的长度n1:\n");
scanf("%d",&n1);
printf("顺序表La\n");
IntiList(La,n1);
printf("请输入要建立的顺序表Lb的长度n2:\n");
scanf("%d",&n2);
printf("顺序表Lb\n");
IntiList(Lb,n2);
IntiList_NULL(Lc);
find_intersection(La,Lb,Lc);
PrintList(Lc);
return 0;
}