数据结构第三周 【项目3 - 求集合并集】

问题及代码：

求两个集合的并集

#include<stdio.h>
#define Maxsize 50
#include<stdio.h>
#include<malloc.h>
typedef int ElemType;
typedef struct
{
	ElemType date[Maxsize];
	int length;
}SqList;
//用数组创建线性表
void CreateList(SqList *&L, ElemType a[], int n)
{
	int i;
	L = (SqList *)malloc(sizeof(SqList));
	for (i = 0; i<n; i++)
		L->date[i] = a[i];
	L->length = n;
}

//初始化线性表InitList(L)
void InitList(SqList *&L)   //引用型指针
{
	L = (SqList *)malloc(sizeof(SqList));
	//分配存放线性表的空间
	L->length = 0;
}

//销毁线性表DestroyList(L)
void DestroyList(SqList *&L)
{
	free(L);
}

//判定是否为空表ListEmpty(L)
bool ListEmpty(SqList *L)
{
	return(L->length == 0);
}

//求线性表的长度ListLength(L)
int ListLength(SqList *L)
{
	return(L->length);
}

//输出线性表DispList(L)
void DispList(SqList *L)
{
	int i;
	if (ListEmpty(L)) return;
	for (i = 0; i<L->length; i++)
		printf("%d ", L->date[i]);
	printf("\n");
}

//求某个数据元素值GetElem(L,i,e)
bool GetElem(SqList *L, int i, ElemType &e)
{
	if (i<1 || i>L->length)  return false;
	e = L->date[i - 1];
	return true;
}

//按元素值查找LocateElem(L,e)
int LocateElem(SqList *L, ElemType e)
{
	int i = 0;
	while (i<L->length && L->date[i] != e) i++;
	if (i >= L->length)  return 0;
	else  return i + 1;
}

//插入数据元素ListInsert(L,i,e)
bool ListInsert(SqList *&L, int i, ElemType e)
{
	int j;
	if (i<1 || i>L->length + 1)
		return false;   //参数错误时返回false
	i--;            //将顺序表逻辑序号转化为物理序号
	for (j = L->length; j>i; j--) //将data[i..n]元素后移一个位置
		L->date[j] = L->date[j - 1];
	L->date[i] = e;           //插入元素e
	L->length++;            //顺序表长度增1
	return true;            //成功插入返回true
}

//删除数据元素ListDelete(L,i,e)
bool ListDelete(SqList *&L, int i, ElemType &e)
{
	int j;
	if (i<1 || i>L->length)  //参数错误时返回false
		return false;
	i--;        //将顺序表逻辑序号转化为物理序号
	e = L->date[i];
	for (j = i; j<L->length - 1; j++) //将data[i..n-1]元素前移
		L->date[j] = L->date[j + 1];
	L->length--;              //顺序表长度减1
	return true;              //成功删除返回true
}
void CreateList(SqList *&L, ElemType a[], int n);
void InitList(SqList *&L);//初始化线性表InitList(L)
void DestroyList(SqList *&L);//销毁线性表DestroyList(L)
bool ListEmpty(SqList *L);//判定是否为空表ListEmpty(L)
int ListLength(SqList *L);//求线性表的长度ListLength(L)
void DispList(SqList *L);//输出线性表DispList(L)
bool GetElem(SqList *L, int i, ElemType &e);//求某个数据元素值GetElem(L,i,e)
int LocateElem(SqList *L, ElemType e);//按元素值查找LocateElem(L,e)
bool ListInsert(SqList *&L, int i, ElemType e);//插入数据元素ListInsert(L,i,e)
bool ListDelete(SqList *&L, int i, ElemType &e);//删除数据元素ListDelete(L,i,e)#endif // LIST_H_INCLUDED
void unionList(SqList *LA, SqList *LB, SqList *&LC)
{
	int i, l;
	ElemType e;
	InitList(LC);
	for (i = 1; i <= ListLength(LA); i++)//把A中所有元素都插入C中
	{
		GetElem(LA, i, e);
		ListInsert(LC, i, e);
	}
	l = ListLength(LA);
	for (i = 1; i <= ListLength(LB); i++)//把B中和A不同的元素插入C中
	{
		GetElem(LB,i, e);
		if (!LocateElem(LA, e))
			ListInsert(LC, ++l, e);
	}
}

//用main写测试代码
int main()
{
	SqList *sq_a, *sq_b, *sq_c;
	ElemType a[6] = { 5,8,7,2,4,9 };
	CreateList(sq_a, a, 6);
	printf("LA: ");
	DispList(sq_a);

	ElemType b[6] = { 2,3,8,6,0 };
	CreateList(sq_b, b, 5);
	printf("LB: ");
	DispList(sq_b);
	unionList(sq_a, sq_b, sq_c);
	printf("LC: ");
	DispList(sq_c);
	return 0;
}

运行结果：