编写3个子函数分别实现两个整数集合的并、交、差运算。
编写3个子函数分别实现两个整数集合的并、交、差运算。要求将两个集合相应运算的结果以递增次序存于数组A中。主函数测试。
#include<iostream>
#include<cstring>
#include<stdlib.h>
using namespace std;
int inter(int *a,int *b,int m,int n)//交集
{undefined
int len=m>n?m:n;
int *c=(int*)malloc(sizeof(int)*len);
int d=0;
for(int i=0;i<m;i++)
{undefined
for(int j=0;j<n;j++)
{undefined
if(a[i]==b[j])
{undefined
c[d++]=a[i];
}
}
}
cout<<"输出a与b的交集:"<<endl;
for(int i=0;i<d;i++)
{undefined
cout<<c[i]<<" ";
}
cout<<endl;
}
int union_a(int *a,int *b,int m,int n)//并集
{undefined
int k=m,es=1;
int *c=(int *)malloc(sizeof(int)*(m+n));
for(int i=0;i<m;i++)
{undefined
c[i]=a[i];
}
for(int i=0;i<n;i++)
{
es=1;
for(int j=0;j<m;j++)
{undefined
if(b[i]==c[j])
{undefined
es=0;
}
}
if(es)
{undefined
c[k]=b[i];
k++;
}
}
cout<<"输出集合a，b的并集："<<endl;
for(int i=0;i<k;i++)
{undefined
cout<<c[i]<<" ";
}
cout<<endl;
}
int diff(int *a,int *b,int m,int n)//差集
{undefined
int k=0;
int *c=(int *)malloc(sizeof(int )*m);
for(int i=0;i<m;i++)
{undefined
c[i]=a[i];
}
for(int i=0;i<n;i++)
{undefined
for(int j=0;j<m;j++)
{undefined
if(b[i]==c[j])
{undefined
for(k=j;k<m;k++)
{undefined
c[k]=c[k+1];
m--;
break;
}
}
}
}
cout<<"输出集合a，b的差集："<<endl;
for(int i=0;i<k;i++)
{undefined
cout<<c[i]<<" ";
}
cout<<endl;
}
int main()
{undefined
int *a,*b;
int m,n;//集合a，b的个数
int c;
cout<<"输入集合a的长度:"<<endl;
cin>>m;
cout<<"输入集合b的长度:"<<endl;
cin>>n;
a=(int*)malloc(sizeof(int)*m);
b=(int*)malloc(sizeof(int)*n);
cout<<"输入集合a:"<<endl;
for(int i=0;i<m;i++)
{undefined
cin>>a[i];
}
cout<<"输入集合b:"<<endl;
for(int i=0;i<n;i++)
{undefined
cin>>b[i];
}
inter(a,b,m,n);
union_a(a,b,m,n);
diff(a,b,m,n);
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;
}
您好，我是有问必答小助手，您的问题已经有小伙伴帮您解答，感谢您对有问必答的支持与关注！如有帮助，请点击我的回答下方的【采纳该答案】按钮帮忙采纳下，谢谢!
PS：问答VIP年卡 【限时加赠：IT技术图书免费领】，了解详情>>> https://vip.csdn.net/askvip?utm_source=1146287632