数据结构：两个有序表的合并

#include<stdio.h>

#define max 1000

//创建结构体

typedef struct{

int data[max];

int length;

}List;

//创建顺序表

void InitList(List *L){

int i,n;

printf("please enter the number of elements\n");

scanf("%d",&n);

printf("please enter the elements in the collection\n");

for(i=0;i<n;i++){

scanf("%d",&L->data[i]);

L->length=n;

}

}

//顺序表的合并

void MergeList(List *LA,List LB){

int e,j,m,n;

m=LA->length;

n=LB.length;

for(int i=0;i<n;i++){

e=LB.data[i];

while(j<LA->length&&e!=LA->data[j]){

j++;

}

if(j>=LA->length){

LA->data[LA->length]=e;

LA->length++;

}

}

}

int main(){

List LA,LB;

InitList(&LA);

InitList(&LB);

MergeList(&LA,LB);

for(int i=0;i<LA.length;i++){

printf("%d ",LA.data[i]);

}

return 0;

}