数据结构c语言使用顺序表实现计算集合的并集的代码

#include <stdio.h>

#define MAXSIZE 100

typedef struct {
int data[MAXSIZE];
int length;
} SqList;

void InitList(SqList *L) {
L->length = 0;
}

void PrintList(SqList L) {
int i;
for (i = 0; i < L.length; i++) {
printf("%d ", L.data[i]);
}
printf("\n");
}

int LocateElem(SqList L, int e) {
int i;
for (i = 0; i < L.length; i++) {
if (L.data[i] == e) {
return i;
}
}
return -1;
}

void ListInsert(SqList *L, int i, int e) {
int j;
if (L->length == MAXSIZE || i < 1 || i > L->length + 1) {
return;
}
for (j = L->length - 1; j >= i - 1; j--) {
L->data[j + 1] = L->data[j];
}
L->data[i - 1] = e;
L->length++;
}

void Union(SqList La, SqList Lb, SqList *Lc) {
int i;
InitList(Lc);
for (i = 0; i < La.length; i++) {
ListInsert(Lc, i + 1, La.data[i]);
}
for (i = 0; i < Lb.length; i++) {
if (LocateElem(*Lc, Lb.data[i]) == -1) {
ListInsert(Lc, Lc->length + 1, Lb.data[i]);
}
}
}

int main() {
SqList La, Lb, Lc;
InitList(&La);
InitList(&Lb);
InitList(&Lc);
ListInsert(&La, 1, 1);
ListInsert(&La, 2, 3);
ListInsert(&La, 3, 5);
ListInsert(&Lb, 1, 2);
ListInsert(&Lb, 2, 4);
ListInsert(&Lb, 3, 6);
Union(La, Lb, &Lc);
printf("La: ");
PrintList(La);
printf("Lb: ");
PrintList(Lb);
printf("Lc: ");
PrintList(Lc);
return 0;
}