数据结构_一元多次方程的表示和相加

#include 
#include 
#include 
using namespace std;
typedef struct  polynomial
{
	int factor;//系数
	int indice;//指数
	struct polynomial *next;
}polynomial,*LinkList;
//尾插法--带头结点
void CreateLink(LinkList &L, int n)
{
	LinkList p,s;
	int i;
	L = (LinkList)malloc(sizeof(polynomial));
	L->next = NULL;
	p = L;
	for (i = 0; i < n; i++)
	{
		s = (LinkList)malloc(sizeof(polynomial));
		cout<<"依次输入多项式系数和指数：";
		cin>>s->factor>>s->indice;
		s->next = NULL;
		p->next = s;
		p = s;
	}
}
//多项式相加(返回带头结点的链表)
void AddList(LinkList List1, LinkList List2, LinkList &L)
{
	LinkList p1,p2,list,s;
	L = (LinkList)malloc(sizeof(polynomial));
	L->next = NULL;
	list = L;
	p1 = List1->next;
	p2 = List2->next;
	while (p1 && p2)
	{
		if (p1->indice < p2->indice)
		{
			s = p1->next;
			list->next = p1;
			list = p1;
			list->next = NULL;//将该节点与原来多项式断开连接
			p1 = s;
		}
		else if (p1->indice == p2->indice)
		{
			p1->factor = p1->factor + p2->factor;
			if (p1->factor != 0)//系数和不为0
			{
				list->next = p1;
				s = p1->next;
				list = p1;
				list->next = NULL;//将该节点与原来多项式断开连接
				p1 = s;
				p2 = p2->next;
			} 
			else //系数和为0
			{
				p1 = p1->next;
				p2 = p2->next;
			}
			
		}
		else
		{
			s = p2->next;
			list->next = p2;
			list = p2;
			list->next = NULL;
			p2 = s;
		}
	}
	if(p1 != NULL) list->next = p1;
	if(p2 != NULL) list->next = p2;
}
//输出结果
void VisitList(LinkList L)
{
	LinkList p;
	p = L->next;
	if (p==NULL)
	{
		cout<<"0"<factor<<"X^"<indice;
		p = p->next;
		if(p != NULL)
			cout<<"+";
	}
	cout<>n;
	CreateLink(p,n);
	cout<<"输出第一个多项式：";
	VisitList(p);
	cout<<"输入第二个多项式的节点个数：";
	cin>>m;
	CreateLink(q,m);
	cout<<"输出第二个多项式：";
	VisitList(q);
	AddList(p,q,L);
	cout<<"输出相加后的多项式："; 
	VisitList(L);
	return 0;
}