#include
using namespace std;
//创建链表
struct Node
{
int content;
Node* next;
};
//输入集合
Node* input_set()
{
Node* head = NULL, *tail=NULL;
int x;
cin >> x;
while (x != 10086)
{
Node*p = new Node;
p->content = x;
p->next = NULL;
if (head == NULL)head = tail = p;
else
{
tail->next = p;
tail = p;
}
cin >> x;
}
return head;
}
//查找
bool find(Node *head, int x)
{
for (Node *p = head; p != NULL; p = p->next)
if (p->content == x) return true;
return false;
}
//添加(从表头插入)
void insert(Node *&head, int x)
{
Node *p = new Node;
p->content = x;
p->next = head;
head = p;
}
//交集
Node *intersection(Node *head1,Node *head2)
{
Node* head = NULL;
for (Node *p = head1; p != NULL; p = p->next)
{
if (find(head2, p->content))insert(head, p->content);
}
return head;
}
//并集
Node *_union(Node *head1, Node *head2)
{
Node *head = NULL, *p;
for (p = head1; p != NULL; p = p->next)
insert(head, p->content);
for (p = head2; p != NULL; p = p->next)
{
if (!find(head1, p->content))insert(head, p->content);
}
return head;
}
//差集
Node *difference(Node *head1, Node *head2)
{
Node *head = NULL, *p;
for (p = head1; p != NULL; p = p->next)
{
if (!find(head2, p->content))insert(head, p->content);
}
return head;
}
//输出集合
void output_set(Node *head)
{
Node *p;
for (p = head; p != NULL; p = p->next)cout << p->content << " ";
cout << endl;
}
//删除集合
void _delete(Node *&head)
{
while(head != NULL)
{
Node*p;
p = head;
head = head->next;
delete p;
}
}
int main()
{
cout << "请依次输入两个集合的元素(以10086结束）";
Node *set1,*set2,*set_intersection,*set_union,*difference_set;
set1=input_set();
set2 = input_set();
set_intersection = intersection(set1, set2);
set_union = _union(set1, set2);
difference_set = difference(set1, set2);
cout << "交集是：";
output_set(set_intersection);
cout << "并集是：";
output_set(set_union);
cout << "差集是：";
output_set(difference_set);
_delete(set1);
_delete(set2);
_delete(set_intersection);
_delete(set_union);
_delete(difference_set);
return 0;
}
