02-线性结构2 一元多项式的乘法与加法运算 （20 分)

#include <stdio.h>

typedef struct PolyNode *Polynomial;
struct PolyNode
{
	int coef;
	int expon;
	Polynomial link;
};
Polynomial ReadPoly();
void PrintPoly(Polynomial P);
void Attach(int c, int e, Polynomial *pRear);
Polynomial Mult(Polynomial P1, Polynomial P2);
Polynomial Add(Polynomial P1, Polynomial P2);

int main(void)
{
	Polynomial P1;
	Polynomial P2, PP, PS;
	P1 = ReadPoly();
	P2 = ReadPoly();
	PP = Mult(P1, P2);
	PrintPoly(PP);
	PS = Add(P1, P2);
	PrintPoly(PS);
	return 0;
}
Polynomial Mult(Polynomial P1, Polynomial P2)
{
	if (!P1 || !P2) return NULL;
	if ((P1->coef == 0 && P1->expon == 0) || (P2->coef == 0 && P2->expon == 0)) return NULL;
	int c, e, ctmp, etmp;
	Polynomial t1 = P1, t2 = P2, Rear, Rearbef, tmp;
	Polynomial P = (Polynomial)malloc(sizeof(struct PolyNode));
	int flag = 0;
	P->link = NULL;
	Rear = P;
	while (t2)