链表集合的各种骚操作

上代码：

#include<iostream>
using namespace std;
typedef struct link
{
	int date;
	struct link *next;
}*pnode,node;
bool addyuansu(pnode link,int e)      //在链表集合中加入单个元素
{
	pnode p,a=new node;
	int f = 1;
	a->date = e;
	p = link->next;
	while (p)
	{
		if (p->date == e)
		{
			f = 0;
			break;
		}
		else
			p = p->next;
	}
	if (f == 1)
	{
		a->next = link->next;
		link->next = a;
		return true;
	}
	else
		return false;
}      
pnode unions(pnode link1, pnode link2)      //求并集
{
	pnode link=new node, a = new node,p,q;
	int f = 1;
	link->next = NULL;
	p = link1->next;
	while (p)
	{
		a = new node;
		a->date = p->date;
		a->next = link->next;
		link->next = a;
		p = p->next;
	}
	p = link2->next;
	while (p)
	{
		f = 1;
		for (q = link1->next; q; q = q->next)
		{
			if (q->date == p->date)
			{
				f = 0;
				break;
			}
		}
		if (f == 1)     //link2中没有重复的元素
		{
			a = new node;
			a->date = p->date;
			a->next = link->next;
			link->next = a;
		}
		p = p->next;
	}
	return link;

} 
int lenlink(pnode link)       //求链表的长度
{
	pnode p;
	int len = 0;
	p = link->next;
	while (p)
	{
		len++;
		p = p->next;
	}
	return len;
}
pnode intersection(pnode head1,pnode head2) //求交集
{
	int len1, len2,f=1;
	pnode p,link=new node,q;
	link->next = NULL;
	len1 = lenlink(head1);
	len2 = lenlink(head2);
	if (len1 < len2)
	{
		p = head1->next;
		while (p)
		{
			f = 1;
			for (q = head2->next; q; q = q->next)
			{
				if (p->date == q->date)        //有一样的元素
				{
					f = 0;
					break;
				}
				
			}
			if (f == 0)                   //把一样的元素加到link中
			{
				addyuansu(link, q->date);
			}
			p = p->next;
		}
	}
	else
	{
		p = head2->next;
		while (p)
		{
			f = 1;
			for (q = head1->next; q; q = q->next)
			{
				if (p->date == q->date)        //有一样的元素
				{
					f = 0;
					break;
				}
			}
			if (f == 0)                   //把一样的元素加到link中
			{
				addyuansu(link, q->date);
			}
			p = p->next;
		}
	}
	return link;
}
pnode chajilink(pnode head1,pnode head2)     //head1-head2
{
	int f = 1;
	pnode link = new node,p,q;
	link->next = NULL;
	p = head1->next;
	while (p)
	{
		f = 1;
		for (q = head2->next; q; q = q->next)
		{
			if (p->date == q->date)
			{
				f = 0;
				break;
			}
		}
		if (f == 1)    //head2中没有的元素
		{
			addyuansu(link, p->date);
		}
		p = p->next;
	}
	return link;

}
bool ifequal(pnode head1, pnode head2)    //判断两个集合是否相等
{
	int len1, len2,f,t=0;
	len1 = lenlink(head1);
	len2 = lenlink(head2);
	if (len1 != len2)
		return 0;
	else
	{
		pnode p = head1->next,q;
		while (p)
		{
			f = 1;
			for (q = head2->next; q; q = q->next)
			{
				if (p->date == q->date)
				{
					f = 0;
					break;
				}

			}
			if (f == 0)
			{
				t++;
			}
			else
				return 0;
			p = p->next;
		}
		if (t == len1)
			return 1;
	}
}
void printyuansu(pnode link)
{
	pnode p;
	p = link->next;
	if (p == NULL)
		cout << "NULL" << endl;
	else
	{
		while (p)
		{
			cout << p->date << ' ';
			p = p->next;
		}
		cout << endl;
	}
	
}
int main()
{
	pnode head1=new node, head2=new node,head3=new node,head4=new node,head5=new node;
	head1->next = NULL;
	head2->next = NULL;
	addyuansu(head1, 1);
	addyuansu(head1, 2);
	addyuansu(head1, 80);
	addyuansu(head1, 2);
	addyuansu(head2, 3);
	addyuansu(head2, 80);
	addyuansu(head2, 1);
	cout << "集合A：";
	printyuansu(head1);
	cout << "集合B：";
	printyuansu(head2);
	cout << "集合A与集合B并集：";
	head3=unions(head1, head2);
	head4 = intersection(head1, head2);
	printyuansu(head3);
	cout << "集合A与集合B交集：";
	printyuansu(head4);
	head5 = chajilink(head1, head2);
	cout << "集合A与集合B差集：";
	printyuansu(head5);
	if (ifequal(head1, head2) == 1)
		cout << "集合A与集合B相等" << endl;
	else
		cout << "集合A与集合B不相等" << endl;

	
}

效果图：