#include "stdio.h"
#include "malloc.h"
typedef int datatype;
typedef struct Node{
datatype data;
Node *next;
}Set;
bool IsInSet(Set *set,datatype data) {
Node *p = set->next;
while(p){
if(p->data == data) return true;
p = p->next;
}
return false;
}
void InsertElem(Set *set,datatype data) {
Node *p = (Node *) malloc (sizeof(Node));
p->data = data;
p->next = set->next;
set->next = p;
}
void Union(Set *set1,Set *set2){ /*求并集*/
Node *p = set2->next;
while(p){
if(!IsInSet(set1,p->data)) InsertElem(set1,p->data);
p = p->next;
}
}
void Intersect(Set *set1,Set *set2) { /*求交集*/
Node *pre = set1,*cur = pre->next;
while(cur) {
if(!IsInSet(set2,cur->data)){
pre->next = cur->next;
free(cur);
}
else pre = cur;
cur = pre->next;
}
}
void Comple(Set *set1,Set *set2) { /*S1 = S1 - S2*/
Node *pre = set1,*cur = pre->next;
while(cur) {
if(IsInSet(set2,cur->data)) {
pre->next = cur->next;
free(cur);
}
else pre = cur;
cur = pre->next;
}
}
void CreateSet(Set *set,datatype endtag) {
Node *newNode;
datatype data;
scanf("%d",&data);
while(data != endtag) {
newNode = (Node*) malloc (sizeof(Node));
newNode->data = data;
newNode->next = set->next;
set->next = newNode;
scanf("%d",&data);
}
}
void ClearSet(Set *set) {
Node *p;
while(set->next) {
p = set->next;
set->next = p->next;
free(p);
}
}
void Display(Set *set) {
Node *p = set->next;
while(p) {
printf("%d\t",p->data);
p = p->next;
}
}
void main( ){
Set *set1,*set2,endtag;
set1 = (Node*) malloc (sizeof(Node));
set1->next = NULL;
set2 = (Node*) malloc (sizeof(Node));
set2->next = NULL;
printf("请设置链表输入结束标识：");
scanf("%d",&endtag);
CreateSet(set1,endtag);
CreateSet(set2,endtag);
Union(set1,set2);
Display(set1);
ClearSet(set1);
ClearSet(set2);
CreateSet(set1);
CreateSet(set2);
Intersect(set1,set2);(
Display(set1);
ClearSet(set1);
ClearSet(set2);
CreateSet(set1);
CreateSet(set2);
Comple(set1,set2);
Display(set1);
}
