【C语言习题】用“顺序表”实现集合的并运算

题目内容

用“顺序表”实现集合的并运算

个人解法

1.自定义的头文件

#include<stdlib.h>
#define Maxsize 100
#define Succeed 1
#define Overflow -1
#define N 99

typedef struct
{
	int* elem;
	int length;
}SqList;

void InitList_Sq(SqList& L)
{
	L.elem = (int*)malloc(sizeof(int) * Maxsize);
	if (!L.elem)
	{
		printf("数据溢出!");
		exit(0);
	}
	L.length = 0;
}

void CreateList_Sq(SqList& L)
{
	int n, i;
	printf("请输入数据元素个数:\n");
	scanf("%d", &n);
	printf("请输入%d个数据元素:\n", n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &L.elem[i]);
		L.length++;
	}
}

void PrintList_Sq(SqList L)
{
	if (!L.elem)
		printf("\n顺序表不存在!");
	else 
	{
		if (L.length == NULL)
			printf("\n顺序表为空!");
		else
		{
			printf("\n该顺序表的元素有:\n");
			for (int i = 0; i < L.length; i++)
				printf("%d\n", L.elem[i]);
		}
	}
}

void GetElem_Sq(SqList L)
{
	int Location;
	printf("请输入欲获取的元素的位置:\n");
	scanf("%d", &Location);
	if (Location<1 || Location>L.length)
		printf("获取失败，请检查输入的元素的位置!\n");
	else
		printf("获取的元素的值为:%d\n", L.elem[Location - 1]);
}

void LocateElem_Sq(SqList L)
{
	int Value, flag = 0;
	printf("请输入欲查找的元素的值:\n");
	scanf("%d", &Value);
	for (int Location2 = 0; Location2 < L.length; Location2++)
		if (L.elem[Location2] == Value)
		{
			printf("查找的元素的位置为:%d\n", Location2 + 1);
			++flag;
		}
	if (flag == 0)
		printf("查找失败，请检查输入的元素的值!\n");
}

void ListInsert_Sq(SqList& L)
{
	int Value, Location;
	printf("请输入欲插入的元素的值:\n");
	scanf("%d", &Value);
	printf("请输入欲插入的元素的位置:\n");
	scanf("%d", &Location);
	if (Location<1 || Location>L.length + 1 || L.length == Maxsize)
		printf("插入失败!\n");
	else
	{
		for (int j = L.length - 1; j >= Location - 1; --j)
			L.elem[j + 1] = L.elem[j];
		L.elem[Location - 1] = Value;
		++L.length;
	}
}

void ListDelete_Sq(SqList& L)
{
	int Location;
	printf("请输入欲删除的元素的位置:\n");
	scanf("%d", &Location);
	if (Location<1 || Location>L.length|| L.length == Maxsize)
		printf("删除失败!\n");
	else
	{
		for (int j = Location - 1; j < L.length - 1; ++j)
			L.elem[j] = L.elem[j + 1];
		--L.length;
	}
}

void DestroyList_Sq(SqList& L)
{
	if (L.elem)
		free(L.elem);
	L.elem = NULL;
}

void ClearList_Sq(SqList& L)
{
	L.length = 0;
}

SqList UnionList_Sq(SqList La, SqList Lb)
{
	SqList Lc;
	InitList_Sq(Lc);
	int k; //k记录Lc中的元素个数
	for (int i = 0; i < La.length; i++) //先把La中的元素都赋给Lc
       	Lc.elem[i] = La.elem[i];
	k = La.length;
	for (int i = 0; i < Lb.length; i++) //依次取出Lb中每个元素 Lb.elem[i]
	{
		int j = 0;
		while ( j < La.length && Lb.elem[j] != La.elem[j]) //在La中查找该元素 
			j++;
		if (j == La.length) //若没找到 
			Lc.elem[k++] = Lb.elem[i];
	}
	Lc.length = k; //修改集合长度
	return Lc;
}

/*
SqList Intersection_Sq(SqList La, SqList Lb)
{
	SqList Lc;
	InitList_Sq(Lc);
	int k; //k记录Lc中的元素个数
	for (int i = 0; i < La.length; i++) //用i遍历顺序表La
	{
		int j = 0;
		while (j < Lb.length && Lb.elem[j] != La.elem[i])
			j++;
		if (j < Lb.length) //表示La.elem[i]在Lb中，将其放到Lc中
			Lc.elem[k++] = La.elem[i];
	}
	Lc.length = k; //修改集合长度
	return Lc;
}

SqList Diffence_Sq(SqList La, SqList Lb)
{
	SqList Lc;
	InitList_Sq(Lc);
	int k = 0; //k记录Lc中的元素个数 
	for (int i = 0; i < La.length; i++) //遍历顺序表La 
	{
		int j = 0;
		while (j < Lb.length && Lb.elem[j] != La.elem[i])
			j++;
		if (j == Lb.length) //表示La.elem[i]不在Lb中，将其放到Lc中 
			Lc.elem[k++] = La.elem[i]);
	}
	Lc.length = k; //修改集合长度 
	return Lc;
}
*/

2.源文件（注意源文件内调用的头文件名须与自定义的头文件名相同）

#define _CRT_SECURE_NO_WARNINGS //防报错
#include<stdio.h>
#include"SqList.h"

int main()
{
	system("color 3");
	SqList L[N];
	int Choice, ListNumber, flag = 0;
	printf("请输入预计需使用的顺序表数:\n");
	scanf("%d", &ListNumber);
	for (int i = 0; i < ListNumber; i++)
	{
		InitList_Sq(L[i]);
		++flag;
	}
	if (flag == ListNumber)
	{
		while (1)
		{
			system("cls");
			printf("0--------结束\n");
			printf("1--------创建\n");
			printf("2--------显示\n");
			printf("3--------取值\n");
			printf("4--------查找\n");
			printf("5--------插入\n");
			printf("6--------删除\n");
			printf("7--------清空\n");
			printf("8--------销毁\n");
			printf("9--------合并\n");
			printf("\n请选择你所需要的操作项(0 - 9):\n");
			scanf("%d", &Choice);
			switch (Choice)
			{
			case 0:
				exit(0);
			case 1:
				int CreateListNumber;
				printf("请输入欲创建的顺序表编号(1 - %d):\n", ListNumber);
				scanf("%d", &CreateListNumber);
				CreateList_Sq(L[CreateListNumber - 1]);
				break;
			case 2:
				int PrintListNumber;
				printf("请输入欲输出的顺序表编号(1 - %d):\n", ListNumber);
				scanf("%d", &PrintListNumber);
				PrintList_Sq(L[PrintListNumber - 1]);
				break;
			case 3:
				int GetElemNumber;
				printf("请输入欲取值的顺序表编号(1 - %d):\n", ListNumber);
				scanf("%d", &GetElemNumber);
				GetElem_Sq(L[GetElemNumber - 1]);
				break;
			case 4:
				int LocateElemNumber;
				printf("请输入欲查值的顺序表编号(1 - %d):\n", ListNumber);
				scanf("%d", &LocateElemNumber);
				LocateElem_Sq(L[LocateElemNumber - 1]);
				break;
			case 5:
				int ListInsertNumber;
				printf("请输入欲插值的顺序表编号(1 - %d):\n", ListNumber);
				scanf("%d", &ListInsertNumber);
				ListInsert_Sq(L[ListInsertNumber - 1]);
				break;
			case 6:
				int ListDeleteNumber;
				printf("请输入欲删值的顺序表编号(1 - %d):\n", ListNumber);
				scanf("%d", &ListDeleteNumber);
				ListDelete_Sq(L[ListDeleteNumber - 1]);
				break;
			case 7:
				int DestroyListNumber;
				printf("请输入欲销毁的顺序表编号(1 - %d):\n", ListNumber);
				scanf("%d", &DestroyListNumber);
				DestroyList_Sq(L[DestroyListNumber - 1]);
				break;
			case 8:
				int ClearListNumber;
				printf("请输入欲清空的顺序表编号(1 - %d):\n", ListNumber);
				scanf("%d", &ClearListNumber);
				ClearList_Sq(L[ClearListNumber - 1]);
				break;
			case 9:
				int UnionListNumber1, UnionListNumber2;
				printf("请输入欲合并的两顺序表编号(1 - %d):\n", ListNumber);
				scanf("%d %d", &UnionListNumber1, &UnionListNumber2);
				L[++ListNumber - 1] = UnionList_Sq(L[UnionListNumber1 - 1], L[UnionListNumber2 - 1]);
				break;
			default:
				printf("操作项不存在，请重新选择!\n");
				break;
			}
			system("pause");
		}
		printf("缓存已被清除!\n");
	}
	else
		printf("顺序表初始化失败!\n");
	return 0;
}

运行结果：

本人拙作，请大佬们点评。