C语言编程离散数学二元关系的代码
用 C 语言实现某集合（整数集合）上二元关系的输入、输出、交、差、并、补、逆、复合、闭包运算和判断是否自反、对称和传递。
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include
using namespace std;
#pragma warning(disable:4996)
//输入二元关系集合并输出 0正常输入 1输出逆集合
void InOutPut(int choice)
{
printf("请输入P集合元素个数：");
int num = 0;
scanf("%d", &num);
if (num < 0)
{
printf("输入错误！\n");
return;
}
if (num == 0)
{
printf("P集合为：空集\n");
return;
}
int** arr = (int**)malloc(sizeof(int*) * num);
int data1=0,data2 = 0;
for (int i = 0; i < num; i++)
{
arr[i] = (int*)malloc(sizeof(int) * 2);
printf("输入第%d对序偶对的第两个值：", i + 1);
scanf("%d", &data1); scanf("%d", &data2);
for (int j = 0; j < i; j++)
{
if (data1==arr[j][0]&&data2==arr[j][1])
{
printf("输入和前面相同元素，根据集合的互异性，请重新输入第%d个元素：\n", i + 1);
scanf("%d", &data1);scanf("%d", &data2);
}
}
arr[i][0] = data1; arr[i][1] = data2;
}
if (choice == 0)
{
printf("P集合为：{");
}
else
{
printf("P集合的逆为:{");
}
for (int i = 0; i < num; i++)
{
if (choice == 0)
{
printf("<%d,%d>,", arr[i][0], arr[i][1]);
}
else
{
printf("<%d,%d>,", arr[i][1], arr[i][0]);
}
}
printf("\b}\n");
free(arr);//释放手动申请的空间
}
//打印输入的集合
void Print(int **arr1,int num1,int **arr2,int num2)
{
if (num1 == 0)
{
printf("P=空集\n");
}
else
{
printf("P={");
for (int i = 0; i < num1; i++)
{
printf("<%d,%d>,", arr1[i][0], arr1[i][1]);
}
printf("\b}\n");
}
if (num2 == 0)
{
printf("Q=空集\n");
}
else
{
printf("Q={");
for (int i = 0; i < num2; i++)
{
printf("<%d,%d>,", arr2[i][0], arr2[i][1]);
}
printf("\b}\n");
}
}
//判断是否有相等元素
bool IsEqual(int val1,int val2,int **arr2,int num2)
{
for (int j = 0; j < num2; j++)
{
if (val1 == arr2[j][0] && val2 == arr2[j][1])
{
return true;
}
}
return false;
}
//判断P，Q Q为P的子集
bool IsSubSet(int** arr1, int num1, int** arr2, int num2)
{
if (num1 < num2)//长度小于肯定非子集
{
return false;
}
else
{//遍历Q元素，发现不等于P元素则否
for (int i = 0; i < num2; i++)
{
if (!IsEqual(arr2[i][0], arr2[i][1], arr1, num1))
{
return false;
}
}
return true;
}
}
//计算并集
void Union(intarr1,int num1,int arr2,int num2)
{
int in = num1 + num2;//集合初始化长度之和
int ret = (int)malloc(sizeof(int*) * in);
int m = 0;
for (int i = 0; i < num1; i++)
{
if (!IsEqual(arr1[i][0], arr1[i][1], arr2, num2))//与其中没有相等的输出
{
//printf("当前第i位置判断有元素：\n");
ret[m] = (int*)malloc(sizeof(int) * 2);
ret[m][0] = arr1[i][0];
ret[m][1] = arr1[i][1];
m++;
}
}
//先把集合2的全部输出来
for (int i = 0; i < num2; i++)
{
ret[m] = (int*)malloc(sizeof(int) * 2);
ret[m][0] = arr2[i][0];
ret[m][1] = arr2[i][1];
m++;
}
if (m == 0)
{
printf("并集：Union(P,Q)=空集\n");
free(ret); return;
}
printf("并集：Union(P,Q)={");
for (int i = 0; i < m; i++)
{
printf("<%d,%d>,", ret[i][0], ret[i][1]);
}
printf("\b}\n");
free(ret);
}
//计算交集
void InterSection(int** arr1, int num1, int** arr2, int num2)
{
if (num1 == 0 || num2 == 0)
{
printf("交集：InterSection(P,Q)=空集\n");
return;
}
int in=(num1>num2)?num2:num1;//集合初始化长度
int** ret = (int**)malloc(sizeof(int*) * in);
int m = 0;
for (int i = 0; i < num1; i++)
{
//printf("大循环%d ", i);
if (IsEqual(arr1[i][0],arr1[i][1],arr2, num2))
{
//printf("当前第i位置判断有元素：\n");
ret[m] = (int*)malloc(sizeof(int) * 2);
ret[m][0] = arr1[i][0];
ret[m][1] = arr1[i][1];
m++;
}
}
if (m == 0)
{
printf("交集：InterSection(P,Q)=空集");
free(ret); return;
}
printf("交集：InterSection(P,Q)={");
for (int i = 0; i <m; i++)
{
printf("<%d,%d>,", ret[i][0], ret[i][1]);
}
printf("\b}\n");
free(ret);
}
//计算差集 输出P有Q没有的
void DifferenceSet(int** arr1, int num1, int** arr2, int num2)
{
int in = (num1 > num2) ? num2 : num1;//集合初始化长度
int** ret = (int**)malloc(sizeof(int*) * in);
if (num1 == 0&&num2==0)//输出空集
{
printf("差集：DifferenceSet(P,Q)=空集\n");
free(ret); return;
}
if (num1 == 0)//输出Q
{
printf("差集：DifferenceSet(P,Q)={\n");
for (int i = 0; i < num2; i++)
{
printf("<%d,%d>,", arr2[i][0], arr2[i][1]);
}
printf("\b}\n");
free(ret);
return;
}
if (num2 == 0)//输出P
{
printf("差集：DifferenceSet(P,Q)={");
for (int i = 0; i < num1; i++)
{
printf("<%d,%d>,", arr1[i][0], arr1[i][1]);
}
printf("\b}\n");
free(ret);
return;
}
int m = 0;
for (int i = 0; i < num1; i++)
{
if (!IsEqual(arr1[i][0], arr1[i][1], arr2, num2))
{
ret[m] = (int*)malloc(sizeof(int) * 2);
ret[m][0] = arr1[i][0];
ret[m][1] = arr1[i][1];
m++;
}
}
if (m == 0)
{
printf("差集：DifferenceSet(P,Q)=空集");
free(ret); return;
}
printf("差集：DifferenceSet(P,Q)={");
for (int i = 0; i < m; i++)
{
printf("<%d,%d>,", ret[i][0], ret[i][1]);
}
printf("\b}\n");
free(ret);
}
//计算对称差集，输出A差集和B差集
void SymmetricDifferenceSet(int** arr1, int num1, int** arr2, int num2)
{
int in = num1 + num2;//集合初始化长度
int** ret = (int**)malloc(sizeof(int*) * in);
int m = 0;
if (num1 == 0&&num2==0)
{
printf("对称差集：SymmetricDifferenceSet(P,Q)=空集");
free(ret); return;
}
for (int i = 0; i < num1; i++)
{
if (!IsEqual(arr1[i][0], arr1[i][1], arr2, num2))
{
ret[m] = (int*)malloc(sizeof(int) * 2);
ret[m][0] = arr1[i][0];
ret[m][1] = arr1[i][1];
m++;
}
}
for (int i = 0; i < num2; i++)
{
if (!IsEqual(arr2[i][0], arr2[i][1], arr1, num1))
{
ret[m] = (int*)malloc(sizeof(int) * 2);
ret[m][0] = arr2[i][0];
ret[m][1] = arr2[i][1];
m++;
}
}
if (m == 0)
{
printf("对称差集：SymmetricDifferenceSet(P,Q)=空集\n");
free(ret); return;
}
printf("对称差集：SymmetricDifferenceSet(P,Q)={");
for (int i = 0; i < m; i++)
{
printf("<%d,%d>,", ret[i][0], ret[i][1]);
}
printf("\b}\n");
free(ret);
}
//计算补集 P为全集 Q为子集
void ComplementSet(int** arr1, int num1, int** arr2, int num2)
{
if (num2 == 0)
{
if (num1 == 0)
{
printf("补集：ComplementSet(P,Q)=空集\n");
return;
}
else//输出P集合
{
printf("补集：ComplementSet(P,Q)={");
for (int i = 0; i < num1; i++)
{
printf("<%d,%d>,", arr1[i][0], arr1[i][1]);
}
printf("\b}\n");
return;
}
}
if (!IsSubSet(arr1, num1, arr2, num2))
{
printf("Q不是P的子集，因此补集=空集\n");
return;
}
int in = (num1 > num2) ? num2 : num1;//集合初始化长度
int** ret = (int**)malloc(sizeof(int*) * in);
int m = 0;
for (int i = 0; i < num1; i++)
{
if (!IsEqual(arr1[i][0], arr1[i][1], arr2, num2))
{
ret[m] = (int*)malloc(sizeof(int) * 2);
ret[m][0] = arr1[i][0];
ret[m][1] = arr1[i][1];
m++;
}
}
printf("补集：ComplementSet(P,Q)={");
for (int i = 0; i < m; i++)
{
printf("<%d,%d>,", ret[i][0], ret[i][1]);
}
printf("\b}\n");
free(ret);
}
//计算并，交，差集，对称差，补集
void Func3()
{
printf("请输入P集合元素个数：");
int num1 = 0;
scanf("%d", &num1);
static int** arr1 = (int**)malloc(sizeof(int*) * num1);//二级指针，相当于创建了二维数组
int data1 = 0, data2 = 0;
for (int i = 0; i < num1; i++)
{
arr1[i] = (int*)malloc(sizeof(int) * 2);
printf("输入第%d对序偶对的第两个值：", i + 1);
scanf("%d", &data1); scanf("%d", &data2);
for (int j = 0; j < i; j++)
{
if (data1 == arr1[j][0] && data2 == arr1[j][1])
{
printf("输入和前面相同元素，根据集合的互异性，请重新输入第%d个元素：\n", i + 1);
scanf("%d", &data1); scanf("%d", &data2);
}
}
arr1[i][0] = data1; arr1[i][1] = data2;
}
printf("请输入Q集合元素个数：");
int num2 = 0;
scanf("%d", &num2);
static int** arr2 = (int**)malloc(sizeof(int*) * num2);
for (int i = 0; i < num2; i++)
{
arr2[i] = (int*)malloc(sizeof(int) * 2);
printf("输入第%d对序偶对的第两个值：", i + 1);
scanf("%d", &data1); scanf("%d", &data2);
for (int j = 0; j < i; j++)
{
if (data1 == arr2[j][0] && data2 == arr2[j][1])
{
printf("输入和前面相同元素，根据集合的互异性，请重新输入第%d个元素：\n", i + 1);
scanf("%d", &data1); scanf("%d", &data2);
}
}
arr2[i][0] = data1; arr2[i][1] = data2;
}
Print(arr1, num1, arr2, num2);//展示当前集合
printf("输入1.交集运算，2.并集运算，3.差集运算，4.对称差集运算，5.补集运算,0退出计算\n");
int choice = 0;
while (true)
{
scanf("%d", &choice);
if (choice == 1)
{
InterSection(arr1, num1, arr2, num2);
}
else if (choice == 2)
{
Union(arr1, num1, arr2, num2);
}
else if (choice == 3)
{
DifferenceSet(arr1, num1, arr2, num2);
}
else if (choice == 4)
{
SymmetricDifferenceSet(arr1, num1, arr2, num2);
}
else if (choice ==5 )
{
ComplementSet(arr1, num1, arr2, num2);
}
else
{
printf("退出二元计算!\n");
return;
}
}
}
//判断a 找出是否有<a,a>形式元素
bool IsContent(int val,int **arr,int num)
{
for (int i = 0; i < num; i++)
{
if (val ==arr[i][0]&&val==arr[i][1])
{
return true;
}
}
return false;
}
//判断自反性质
int IsReClosure(int** arr, int num)//返回值 -1：反自反 1：自反 0：都不是
{
int count = 0;
for (int i = 0; i < num; i++)
{
for (int j = 0; j < num; j++)
{
if (IsContent(arr[i][0], arr, num)==1)//找到一个匹配就加1
{
count++;
}
}
}
if (count == 0)//反自反
{
return -1;
}
else if(count == num)//自反
{
return 1;
}
else //不是自反 也不是反自反
{
return 0;
}
}
//对称性质的判断
int IsSymmetric(int **arr,int num)//-1 反对称 1对称 -2都是 2都不是
{
//count1来判断 <a,a> <b,b> 这样的自反对称元素个数
//count2判断 <a,b> <b,a> 这样的对称元素个数
int count1 = 0;int count2 = 0;
for (int i = 0; i < num; i++)
{
if (arr[i][0] == arr[i][1])
{
count1++;
}
for (int j = 0; j < num; j++)
{
if (IsEqual(arr[i][1], arr[i][0], arr, num) == 1&&arr[i][0]!=arr[i][1])//找到一个匹配就加1
{
count2++;
break;
}
}
}
//printf("测试count1=%d count2=%d\n", count1, count2);
if (count1==num&&count2 == 0)//对称和反对称 矩阵对角线占满了
{
return -2;
}
else if (count1<num&&count2 == 0)//只是反对称 对角线占了一部分 两侧对称的为0
{
return -1;
}
else if (num==(count1+count2))//只有对称 count2！=0隐含 排除count1=num count2=0情况 count1+count2=num
{
return 1;
}
else if(num>(count2+count1)) //都不是 count2!=0(隐含）
{
return 2;
}
}
//传递性质判断 1是传递 2 不是传递
int IsTrans(int** arr, int num)
{
for (int i = 0; i < num; i++)
{
//printf("测试1 a=%d b=%d\n", arr[i][0],arr[i][1]);
//arr[i][1] b
for (int j = 0; j < num; j++)
{
//arr[j][0] b arr[j][1] c
if (arr[j][0] == arr[i][1])
{
//printf("测试2 b=%d c=%d\n", arr[j][0], arr[j][1]);
for (int k = 0; k < num; k++)
{
//printf("测试3 b=%d c=%d\n", arr[j][0], arr[j][1]);
if (!IsEqual(arr[i][0],arr[j][1],arr,num))
{
return 2;
}
}
}
}
}
return 1;
}
//自反闭包运算
void ReClosue(int** arr, int num)
{
int** ret = (int**)malloc(sizeof(int*) * 3 * num);//分配足够空间
int m = 0;//表示元素个数
//先输出当前元素
printf("自反闭包为：{");
for (int i = 0; i < num; i++)
{
//printf("测试1:");
printf("<%d,%d>,", arr[i][0], arr[i][1]);
ret[m] = (int*)malloc(sizeof(int) * 2);
ret[m][0] = arr[i][0]; ret[m][1] = arr[i][1];
m++;
if(!IsEqual(arr[i][0], arr[i][0], ret, m))
{
// printf("测试2：");
ret[m] = (int*)malloc(sizeof(int) * 2);
ret[m][0] = arr[i][0]; ret[m][1] = arr[i][0];
m++;
printf("<%d,%d>,", arr[i][0], arr[i][0]);
}
if (!IsEqual(arr[i][1], arr[i][1], ret, m))
{
//printf("测试3:");
ret[m] = (int*)malloc(sizeof(int) * 2);
ret[m][0] = arr[i][1]; ret[m][1] = arr[i][1];
m++;
printf("<%d,%d>,", arr[i][1], arr[i][1]);
}
}
printf("\b}\n");
}
//对称闭包运算
void Symmetric(int** arr, int num)
{
int** ret = (int**)malloc(sizeof(int*) * 2 * num);//分配足够空间
int m = 0;//表示元素个数
//先输出当前元素
printf("对称闭包为：{");
for (int i = 0; i < num; i++)
{
}
}
//传递闭包运算
void Trans(int* arr, int num)
{
}
//Func4
void Func4()
{
printf("请输入集合元素个数：");
int num = 0;
scanf("%d", &num);
if (num < 0)
{
printf("输入错误！\n");
return;
}
int** arr = (int**)malloc(sizeof(int*) * num);
int data1 = 0, data2 = 0;
for (int i = 0; i < num; i++)
{
arr[i] = (int*)malloc(sizeof(int) * 2);
printf("输入第%d对序偶对的第两个值：", i + 1);
scanf("%d", &data1); scanf("%d", &data2);
for (int j = 0; j < i; j++)
{
if (data1 == arr[j][0] && data2 == arr[j][1])
{
printf("输入和前面相同元素，根据集合的互异性，请重新输入第%d个元素：\n", i + 1);
scanf("%d", &data1); scanf("%d", &data2);
}
}
arr[i][0] = data1; arr[i][1] = data2;
}
printf("P={");
for (int i = 0; i < num; i++)
{
printf("<%d,%d>,", arr[i][0], arr[i][1]);
}
printf("\b}\n");
int choice = 0;
printf("输入1.自反闭包，2.对称闭包，3.传递闭包, 0退出计算\n");
while (true)
{
scanf("%d", &choice);
if (choice == 1)
{
ReClosue(arr, num);
}
else if (choice == 2)
{
}
else if (choice == 3)
{
}
else
{
printf("退出闭包计算成功!\n");
return;
}
}
free(arr);//释放手动申请的空间
}
//判断性质函数5
void Func5()
{
printf("请输入集合元素个数：");
int num = 0;
scanf("%d", &num);
if (num < 0)
{
printf("输入错误！\n");
return;
}
int** arr = (int**)malloc(sizeof(int*) * num);
int data1 = 0, data2 = 0;
for (int i = 0; i < num; i++)
{
arr[i] = (int*)malloc(sizeof(int) * 2);
printf("输入第%d对序偶对的第两个值：", i + 1);
scanf("%d", &data1); scanf("%d", &data2);
for (int j = 0; j < i; j++)
{
if (data1 == arr[j][0] && data2 == arr[j][1])
{
printf("输入和前面相同元素，根据集合的互异性，请重新输入第%d个元素：\n", i + 1);
scanf("%d", &data1); scanf("%d", &data2);
}
}
arr[i][0] = data1; arr[i][1] = data2;
}
printf("P={");
for (int i = 0; i < num; i++)
{
printf("<%d,%d>,", arr[i][0], arr[i][1]);
}
printf("\b}\n");
int choice = 0;
printf("输入1.自反性判断，2.对称性判断，3.传递性判断, 0退出判断\n");
while (true)
{
scanf("%d", &choice);
if (choice == 1)
{
//输出自反性性质的部分
int res = IsReClosure(arr, num);
if (res == 0)
{
printf("既不是自反也不是反自反！\n");
}
else if (res == -1)
{
printf("该集合具有反自反性！\n");
}
else
{
printf("该集合具有自反性！\n");
}
}
else if (choice == 2)
{
//输出对称性的性质部分
int res = IsSymmetric(arr, num);
if (res == -1)
{
printf("该集合具有反对称性！\n");
}
else if (res == -2)
{
printf("该集合既是对称性也具有反对称性！\n");
}
else if (res == 1)
{
printf("该集合只有对称性！\n");
}
else if (res == 2)
{
printf("该集合既不是对称性也不具有反对称性！\n");
}
else
{
printf("逻辑错误！\n");
}
}
else if (choice == 3)
{
//输出传递性质部分
int res = IsTrans(arr, num);
if (res == 1)
{
printf("该集合是传递闭包！\n");
}
else if (res == 2)
{
printf("该集合不是传递闭包！\n");
}
}
else
{
printf("退出判断成功!\n");
return;
}
}
free(arr);//释放手动申请的空间
}
//主菜单
void ShowMenu()//展示主菜单
{
int choice;
while (true)//循环输出主菜单
{
system("cls");
printf("\t\t 二元关系计算界面\n");
printf("\t\t 1. 输入输出\n");
printf("\t\t 2. 单目逆运算\n");
printf("\t\t 3. 双目运算\n");
printf("\t\t 4. 闭包运算\n");
printf("\t\t 5. 性质判断\n");
printf("\t\t 0. 退出\n");
printf("请根据选项输入您的选择: ");
scanf("%d", &choice);
switch (choice)
{
case 1:
InOutPut(0);
system("pause");
break;
case 2:
InOutPut(1);
system("pause");
break;
case 3:
Func3();
system("pause");
break;
case 4:
Func4();
system("pause");
break;
case 5:
Func5();
system("pause");
break;
case 0://退出
exit(0);
break;
default://输入错误
printf("输入有误，请重新输入");
system("pause");
system("cls");
break;
}
}
}
int main()
{
//进入主菜单
ShowMenu();
return 0;
}
完整代码如下
#include<stdio.h>
#include<stdlib.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define OVERFLOW -1
#define LISTSIZE 100 //初始表空间大小
#define addlength 20 //表长增量
typedef int Status;
typedef char ElemType;
typedef struct{
ElemType *elem;
int length;
int listsize;
}SqList;
SqList La,Lb,Lc,Ld;
Status InitList_Sq(SqList &L){
L.elem = (ElemType *)malloc(LISTSIZE * sizeof(ElemType));
if(!L.elem) exit(-1);
L.length = 0;
L.listsize = LISTSIZE;
return OK;
}
Status ListInsert_Sq(SqList &L,int i,ElemType e){
ElemType *newbase,*p,*q;
if(i < 1 || i > L.length + 1)
return ERROR;
if(L.length >= L.listsize){
newbase = (ElemType *)realloc(L.elem,(L.listsize +addlength) * sizeof(ElemType));
if(!newbase) exit(-1);
L.elem = newbase;
L.listsize +=addlength;
}
q = &(L.elem[i - 1]); //q为插入位置
for(p = &(L.elem[L.length - 1]); p >= q; --p)
*(p + 1) = *p; //插入位置及之后的元素往右移
*q = e; //插入e
L.length++; //表长加1
return OK;
}
void CreateList_Sq(SqList &L){
ElemType ch;
int n=0,j;
while((ch) != '\n'){
scanf("%c",&ch);
for(j = 0; j < L.length; j++)
if(ch == L.elem[j]){
n=1;
break;
}
else
n=0;
if(!n && ch != '\n')
ListInsert_Sq(L,L.length+1,ch);
}
}
/**判断两元素是否相等,若相等则返回TRUE;否则返回FALSE**/
Status Equal(ElemType a,ElemType b){
if(a == b)
return 1;
else
return 0;
}
int LocateElem_Sq(SqList L,ElemType e,Status(* compare)(ElemType,ElemType)){
ElemType *p;
int i;
i = 1; //i的初值为第1个元素的位序
p = L.elem; //p的初值为第1个元素的储存位置
while(i <= L.length && !(* compare)(*p++,e)) ++i;
if(i <= L.length) return i;
else return 0;
} //该函数的时间复杂度为O(n)
/**打印顺序表函数**/
void Print_Sq(SqList L){
int i;
for(i = 0; i < L.length; i++)
{
if(L.elem[i]>='a'&&L.elem[i]<='z')
{
printf("%2c",L.elem[i]);
}
}
if(L.length == 0)
printf("该集合为空集");
}
/**求集合的并集的函数**/
void bing(SqList La,SqList Lb,SqList &Lc){
int i;
ElemType elem;
Lc.length=0;
for(i = 0; i < La.length; i++)
Lc.elem[Lc.length++]=La.elem[i];
for(i = 1; i <= Lb.length; i++){
elem = Lb.elem[i-1];
if(!LocateElem_Sq(La,elem,Equal))
ListInsert_Sq(Lc,Lc.length+1,elem);
}
}
/**求集合的交集的函数**/
void jiao(SqList La,SqList Lb,SqList &Lc){
int i;
ElemType elem;
Lc.length = 0;
for(i = 1; i <= La.length; i++){
elem = La.elem[i-1];
if(LocateElem_Sq(Lb,elem,Equal))
ListInsert_Sq(Lc,Lc.length+1,elem);
}
}
/**求集合的差集函数**/
void cha(SqList La,SqList Lb,SqList &Lc){
int i;
ElemType elem;
Lc.length = 0;
for(i = 1; i <= La.length; i++){
elem = La.elem[i-1];
if(!LocateElem_Sq(Lb,elem,Equal))
ListInsert_Sq(Lc,Lc.length+1,elem);
}
}
/**求集合的补集函数**/
void buji(SqList La,SqList Lb,SqList &Lc,SqList &Ld){
int i;
ElemType elem;
Ld.length = 0;
bing(La,Lb,Lc);
for(i = 1; i <= Lc.length; i++)
{
elem = Lc.elem[i-1];
if(!LocateElem_Sq(La,elem,Equal))
ListInsert_Sq(Ld,Ld.length+1,elem);
}
}
void select(){
char s;
int l=1;
InitList_Sq(La);
printf("****** 请输入你的第一个集合：******\n");
CreateList_Sq(La);
printf("集合A为:");
Print_Sq(La); //实现表LA的操作
printf("\n");
InitList_Sq(Lb);
printf("****** 请输入你的第二个集合：******\n");
CreateList_Sq(Lb);
printf("集合B为:");
Print_Sq(Lb); //实现表LB的操作
printf("\n\n");
InitList_Sq(Lc); //初始化表LC的操作
InitList_Sq(Ld); //初始化表Ld的操作
while(l){
printf("******* 您可以选择a、b、c或者d执行以下操作 ******\n\n");
printf("************* a、进行集合的并运算 ***************\n");
printf("************* b、进行集合的交运算 ***************\n");
printf("************* c、进行集合的差运算 ***************\n");
printf("************* d、进行集合的补运算 ***************\n");
printf("************* 0、 退 出 程 序 ***************\n");
scanf("%c",&s);
switch(s){
case 'a':bing(La,Lb,Lc);
printf("集合A与集合B的并集为:");
Print_Sq(Lc); //实现表LA与表LB并集的操作
printf("\n");
break;
case 'b' : jiao(La,Lb,Lc);
printf("集合A与集合B的交集为:");
Print_Sq(Lc); //实现表LA与表LB交集的操作
printf("\n");
break;
case 'c' : cha(La,Lb,Lc);
printf("集合A与集合B的差集为:");
Print_Sq(Lc); //实现表LA与表LB差集的操作
printf("\n");
break;
case 'd' : buji(La,Lb,Lc,Ld);
printf("集合A的补集为:");
Print_Sq(Ld); //实现表LA的补集操作
printf("\n");
break;
case 'e' : exit(0);
break;
default : printf("tenter data error!\n");
printf("\n");
}
printf("**** 继续执行请输入1，否则请输入0 ****\n");
scanf("%d",&l);
getchar();
}
}
int main()
{
select();
return 0;
}
运行结果如下:
如有帮助，请采纳，十分感谢！