浙大 数据结构 一元多项式的乘法与加法运算

这题还是建议还是可以练练，逻辑不复杂，这个也是参考书本以及别人作者的

#define _CRT_SECURE_NO_WARNINGS//这是在vs中使用C的时候需要添加的，
//如果在oj上面用C++提交也需要添加
//当然这里用c的朋友可以换成#include <stdio.h> 和 #include <stdlib.h>
//#include <stdlib.h>
//#include <stdlib.h>
#include<iostream>
using namespace std;


typedef struct PolyNode *Polynomial;
struct PolyNode {
	int coef;
	int expon;
	Polynomial link;
};
 
void Attach(int c, int e, Polynomial *pRear);
Polynomial ReadPoly();
void PrintPoly(Polynomial P);
Polynomial Mult(Polynomial P1, Polynomial P2);
Polynomial Add(Polynomial P1, Polynomial P2);
int main() {
 
	Polynomial P1, P2, PP, PS;
	P1 = ReadPoly();
	P2 = ReadPoly();
	PP = Mult(P1, P2);
	PrintPoly(PP);
	PS = Add(P1, P2);
	PrintPoly(PS);
	//system("pause");
	return 0;
}
 
void Attach(int c, int e, Polynomial *pRear)
{
	Polynomial P;
	P = (Polynomial)malloc(sizeof(struct PolyNode));
	P->coef = c; // 对新结点赋值
	P->expon = e;
	P->link = NULL;
	(*pRear)->link = P;
	*pRear = P; // 修改pRear值
}
 
Polynomial ReadPoly()
{
	Polynomial P, Rear, t;
	int c, e, N;
	scanf("%d", &N);
	//临时创建一个头结点，以后还要删除
	P = (Polynomial)malloc(sizeof(struct PolyNode)); // 链表头空结点
	P->link = NULL;
	Rear = P;
	while (N--) {
		scanf("%d %d", &c, &e);
		Attach(c, e, &Rear); // 将当前项插入多项式尾部 
	}
	t = P; P = P->link; free(t); // 删除临时生成的头结点
	return P;
}
 
void PrintPoly(Polynomial P)
{ // 输出多项式
	int flag = 0; // 辅助调整输出格式用 
	if (!P) { printf("0 0\n"); return; }
	while (P) {
		if (!flag)
			flag = 1;
		else
			printf(" ");
		printf("%d %d", P->coef, P->expon);
		P = P->link;
	}
	printf("\n");
}
 
Polynomial Mult(Polynomial P1, Polynomial P2)
{
	Polynomial P, Rear, t1, t2, t;
	int c, e;
	if (!P1 || !P2) return NULL;//如果有一个为NULL，就得返回了。因为没法做乘法。
	t1 = P1; t2 = P2;
	P = (Polynomial)malloc(sizeof(struct PolyNode)); P->link = NULL;
	Rear = P;
	while (t2) { // 先用P1的第1项乘以P2，得到P 
		Attach(t1->coef*t2->coef, t1->expon + t2->expon, &Rear);
		t2 = t2->link;
	}
	t1 = t1->link;
	while (t1) {
		t2 = P2; Rear = P;
		while (t2) {
			e = t1->expon + t2->expon;
			c = t1->coef * t2->coef;
			//先判断是不是指向NULL
			while (Rear->link && Rear->link->expon > e) //从合成项中从前往后遍历，一直到不小于它的值
				Rear = Rear->link;
			if (Rear->link && Rear->link->expon == e) { //
				if (Rear->link->coef + c)
					Rear->link->coef += c;
				else {
					t = Rear->link;
					Rear->link = t->link;
					free(t);
				}
			}
			else {
				t = (Polynomial)malloc(sizeof(struct PolyNode));
				t->coef = c; t->expon = e;
				t->link = Rear->link;
				Rear->link = t; Rear = Rear->link;
			}
			t2 = t2->link;
		}
		t1 = t1->link;
	}
	t2 = P; P = P->link; free(t2);
	return P;
}
 
Polynomial Add(Polynomial P1, Polynomial P2) {
	Polynomial P, Rear, t1, t2, t;
	int c, e,sum;
	if (!P1 && !P2) return NULL;//如果都为NULL，就得返回了。因为没法做加法。
	t1 = P1; 
	t2 = P2;
	P = (Polynomial)malloc(sizeof(struct PolyNode)); P->link = NULL;
	Rear = P;
	//注意该链表没有头结点
	while (t1&&t2) {
		if (t1->expon < t2->expon)
		{
			Rear->link = t2;
			t2 = t2->link;
			Rear = Rear->link;
		}
		else if (t2->expon < t1->expon) {
			Rear->link = t1;
			t1 = t1->link;
			Rear = Rear->link;
		}
		else //相等
		{
			sum=t1->coef+t2->coef;//在这里对代码参考书上做了修改，下面/* */的注释部分，是作者的源码
           if(sum) Attach(sum,t1->expon,&Rear);
            t1=t1->link;
            t2=t2->link;
            
            /*t2->coef += t1->coef;
			if (t2->coef != 0) //为0就抵消了
			{
				Rear->link = t2;
				t2 = t2->link;
				Rear = Rear->link;
			}
			else {
				t = t2;
				t2 = t2->link;
				free(t);
			}
			t = t1;
			t1 = t1->link;
			free(t);//之前不小心写成了 free(t1)。结果一直段错误！真是郁闷。*/
		}
 
	}
		
	if (t1) {
		Rear->link = t1; 
	}
	else {
		Rear->link = t2;
	}
 
	t2 = P; P = P->link; free(t2);
	return P;
 
}