一元多项式的加法与乘法实现

#include <iostream>
using namespace std;
typedef struct PolyNode *Polynomial;
//结点结构
struct PolyNode
{
	int coef;//系数
	int expon;//指数
	Polynomial next;
};
void Attach(int c, int e, Polynomial *pRear)//在建立链表时，需要不断修改尾指针的值，所以传递指向尾指针的指针，以便修改尾指针的值
{
	Polynomial p;
	p = (Polynomial)malloc(sizeof(struct PolyNode));
	//给新结点赋值
	p->coef = c;
	p->expon = e;
	p->next = nullptr;
	(*pRear)->next = p;
	(*pRear) = p;
}
//读入多项式
Polynomial ReadPoly()
{
	Polynomial rear,p,t;
	p = (Polynomial)malloc(sizeof(struct PolyNode));//链表的空头结点 
	p->next = nullptr;
	rear = p;
	int termNumber;
	int c, e;
	cout << "输入多项式的项数：";
	cin >> termNumber;
	cout << "输入多项式的系数与指数：";
	while (termNumber--)
	{
		cin >> c >> e;
		Attach(c,e,&rear);
	}
	t = p;
	p = p->next;
	free(t);//删除临时生成的空头结点
	return p;
}
//多项式相乘
Polynomial Mult(Polynomial p1, Polynomial p2)
{
	Polynomial t1, t2, p,rear,t;
	int c, e;
	if (!p1 || !p2)
	{
		return nullptr;
	}
	t1 = p1; 
	t2 = p2;
	p = (Polynomial)malloc(sizeof(struct PolyNode));
	p->next = nullptr;
	rear = p;
	//先用p1的第一项乘以p2，得到p
	while (t2)
	{
		Attach(t1->coef*t2->coef, t1->expon + t2->expon, &rear);
		t2 = t2->next;
	}
	t1 = t1->next;
	while (t1)
	{
		t2 = p2;
		rear = p;//让rear指向空的头结点
		while (t2)
		{
			c = t1->coef*t2->coef;
			e = t1->expon + t2->expon;
			while (rear->next&&rear->next->expon > e)
			{
				rear = rear->next;
			}
			if (rear->next&&rear->next->expon == e)
			{
				if (rear->next->coef + c)
					rear->next->coef += c;//如果系数相加不为0，则赋值系数的和
				//如果系数相加为0，则删除该结点
				else
				{
					t = rear->next;
					rear->next = t->next;
					free(t);
				}
			}
			//插入新的结点
			else
			{
				t = (Polynomial)malloc(sizeof(struct PolyNode));
				t->coef = c;
				t->expon = e;
				t->next = rear->next;
				rear->next = t;
				rear = rear->next;
			}
			t2 = t2->next;
		}
		t1 = t1->next;
	}
	t2 = p;
	p = p->next;
	free(t2);
	return p;
}
//多项式相加
Polynomial Add(Polynomial p1, Polynomial p2)
{
	Polynomial front, rear, temp,t1,t2;
	t1 = p1; t2 = p2;//用t1,t2代替p1,p2,防止修改p1,p2的原有值
	rear = (Polynomial)malloc(sizeof(struct PolyNode));//尾指针
	rear->next = nullptr;
	front = rear;//空的头结点
	while (t1&&t2)
	{
		if (t1->expon == t2->expon)
		{
			int sum = t1->coef + t2->coef;
			if (sum)
			{
				Attach(sum, t1->expon, &rear);
			}
			t1 = t1->next;
			t2 = t2->next;
		}
		else if (t1->expon > t2->expon)
		{
			Attach(t1->coef, t1->expon, &rear);
			t1 = t1->next;
		}
		else
		{
			Attach(t2->coef, t2->expon, &rear);
			t2 = t2->next;
		}
	}
	while (t1)
	{
		Attach(t1->coef, t1->expon, &rear);
		t1 = t1->next;
	}
	while (t2)
	{
		Attach(t2->coef, t2->expon, &rear);
		t2 = t2->next;
	}
	temp = front;
	front = front->next;
	free(temp);
	return front;
}
//打印多项式
void PrintPoly(Polynomial p)
{
	int flag = 0;//辅助调整格式输出
	if (!p)
	{
		cout << 0 << " " << 0 << endl;
		return;
	}
	while (p)
	{
		if (!flag)
			flag = 1;
		else
			cout << "  ";
		cout << p->coef << ' ' << p->expon;
		p = p->next;
	}
	cout << endl;
}
int main()
{
	Polynomial p1,p2,ps,pp;
	p1 = ReadPoly();
	p2 = ReadPoly();
	ps = Add(p1, p2);
	pp = Mult(p1, p2);
	PrintPoly(p1);
	PrintPoly(p2);
	PrintPoly(ps);
	PrintPoly(pp);
	return 0;
}