C++ 实现两个多项式的合并

/*两个多项式合并*/

#include <iostream>
using namespace std;
typedef struct node     /*定义结构体*/
{
	int factor;  //系数
	int indice;  //幂
	struct node *next;
}node,*LinkList;

void CreateLink(LinkList &L, int n)
{
	LinkList p,s;  
	int i;  

	L = (LinkList)malloc(sizeof(node));  //头结点
	L->next = NULL;  

	p = L;  
	for (i = 0; i < n; i++)    //尾插法建链表
	{  
		s = (LinkList)malloc(sizeof(node));  
		cout<<"input the factor and indice:";
		cin>>s->factor>>s->indice;  
		s->next = NULL;  
		p->next = s;  
		p = s;  
	}  
}

void Sort(LinkList &L)                           //按indice域递减排序
{
	LinkList p=L->next,q,r;
	if(p!=NULL)                                       //若原单链表中有一个或多个数据结点
	{
		r = p->next;                                    //r保存*p结点的后继结点的指针
		p->next = NULL;                                 //构造只含一个数据结点的有序表
		p = r;
		while(p != NU