#include<iostream>
#include<malloc.h>
#define MAXSIZE 100//顺序表长度上限
using namespace std;
typedef int DataType;
typedef struct{
DataType data[MAXSIZE];//顺序表存储结构
int length;//顺序表长度
}SeqList,* PSeqList;
int main(){
/*函数声明*/
void panduan(PSeqList L);
PSeqList Init_SeqList(void);
int Locate_SeqList(PSeqList L,DataType x);
void Insert_SeqList(PSeqList L,int i,DataType x);
void Delete_SeqList(PSeqList L,int i);
void Show_SeqList(PSeqList L);
void Inter_sec(PSeqList A,PSeqList B);
void Merge_sec(PSeqList A,PSeqList B);
PSeqList A=Init_SeqList();
PSeqList B=Init_SeqList();
cout<<"两集合的交集为:";
Inter_sec(A,B);
cout<<"两集合的并集为:";
Merge_sec(A,B);
return 0;
}
/*判断顺序表是否存在和溢出*/
void panduan(PSeqList L){
if(!L){
cout<<"表不存在!";
return;
}
if(L->length>MAXSIZE){
cout<<"表溢出!";
return;
}
}
/*创建顺序表*/
PSeqList Init_SeqList(void){
PSeqLi
顺序表求集合交并——C++实现
最新推荐文章于 2021-07-12 08:58:04 发布