#include<stdio.h>
typedef struct{
int *elem;
int length;
}sqlist;
int initlist(sqlist &L) //顺序表初始化
{
L.elem=new int[10000];
if(!L.elem) return 0;
L.length=0;
return 1;
}
int getelem(sqlist L,int i,int e) //顺序表取值
{
if(i<1||i>L.length) return 0;
e=L.elem[i-1];
return e;
}
int locateelem(sqlist L,int e) //顺序表查找
{
for(int i=0;i<L.length;i++)
{
if(L.elem[i]==e) return i+1;
}
return 0;
}
int listinsert(sqlist &L,int i,int e) //顺序表插入
{
if(i<1&&i>L.length+1) return 0;
for(int j=L.length;j>=i;j--)
L.elem[j]=L.elem[j-1];
L.elem[i-1]=e;
L.length++;
return 1;
}
int deletlist(sqlist &L,int i) //顺序表的删除
{
if(i<1||i>L.length) return 0;
for(int j=i-1;j<L.length-1;j++) L.elem[j]=L.elem[j+1];
L.length--;
return 1;
}
void mergelist(sqlist &A,sqlist &B)
{
int m=A.length,n=B.length;
for(int i=1;i<=n;i++)
{
int e;
int o=getelem(B,i,e);
if(!locateelem(A,o)) //查找是否有相同的数值
listinsert(A,++m,o); //将 o插到A表尾部
}
}
int main()
{
sqlist alist,blist;
initlist(alist);
initlist(blist);
int n;
while(~scanf("%d",&n)&&n!=0) listinsert(alist,alist.length+1,n);
while(~scanf("%d",&n)&&n!=0) listinsert(blist,blist.length+1,n);
mergelist(alist,blist);
for(int i=0;i<alist.length;i++)
printf("%d ",alist.elem[i]);
return 0;
}
数据结构顺序表合并
最新推荐文章于 2023-10-28 10:16:04 发布