2020-08-29

一元多项式的乘法与加法

输入格式:
输入分2行，每行分别先给出多项式非零项的个数，再以指数递降方式输入一个多项式非零项系数和指数（绝对值均为不超过1000的整数）。数字间以空格分隔。
输出格式:
输出分2行，分别以指数递降方式输出乘积多项式以及和多项式非零项的系数和指数。数字间以空格分隔，但结尾不能有多余空格。零多项式应输出0 0。

输入样例:

4 3 4 -5 2  6 1  -2 0
3 5 20  -7 4  3 1

输出样例:

15 24 -25 22 30 21 -10 20 -21 8 35 6 -33 5 14 4 -15 3 18 2 -6 1
5 20 -4 4 -5 2 9 1 -2 0

用链表完成

多项式结构设计：

typedef struct PolyNode *Polynomial;
struct PolyNode
{
 int coef;
 int expon;
 Polynomial link;
};

主函数设计：

int main()
{
 Polynomial P1, P2, PP, PS;
 P1 = ReadPoly();//读
 P2 = ReadPoly();
 PP = Mult(P1, P2);//乘
 PrintPoly(PP);//写
 PS = Add(P1, P2);//加
 PrintPoly(PS);
 return 0;
}

多项式的读入：

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;
}

Attach函数：

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值，*pRear为当前结果表达式尾部指针
}

写多项式：

void PrintPoly(Polynomial P)
{
 int flag = 0;
 if (!P){
  	printf("0 0\n");
  	return;
 }
 while (P){
  	if (flag == 0)
   		flag = 1;
  	else
   		printf(" ");//flag 输出格式“ ”数字
  printf("%d %d", P->coef, P->expon);
  P = P->link;
 }
 printf("\n");
}

完整代码如下：

#include<stdio.h>
#include<stdlib.h>

typedef struct PolyNode *Polynomial;
struct PolyNode
{
	int coef;
	int expon;
	Polynomial link;
};
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;
}
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;
}
Polynomial Mult(Polynomial P1, Polynomial P2)
{
	Polynomial P, Rear, t1, t2, t;
	int c, e;
	if (!P1 || !P2) return NULL;
	t1 = P1;
	t2 = P2;
	P = (Polynomial)malloc(sizeof(struct PolyNode));
	Rear = P;
	while (t2)
	{
		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;
			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 front, rear, temp;
	int sum;
	rear = (Polynomial)malloc(sizeof(struct PolyNode));
	front = rear;
	while (P1 && P2)
	{
		if (P1->expon > P2->expon)
		{
			Attach(P1->coef, P1->expon, &rear);
			P1 = P1->link;
		}
		else if (P1->expon < P2->expon)
		{
			Attach(P2->coef, P2->expon, &rear);
			P2 = P2->link;
		}
		else
		{
			sum = P1->coef + P2->coef;
			if (sum)
				Attach(sum, P1->expon, &rear);
			P1 = P1->link;
			P2 = P2->link;
		}	
	}
	while (P1)
	{
		Attach(P1->coef, P1->expon, &rear);
		P1 = P1->link;
	}
	while (P2)
	{
		Attach(P2->coef, P2->expon, &rear);
		P2 = P2->link;
	}
	rear->link = NULL;
	temp = front;
	front = front->link;
	free(temp);
	return front;
}
void PrintPoly(Polynomial P)
{
	int flag = 0;
	if (!P)
	{
		printf("0 0\n");
		return;
	}
	while (P)
	{
		if (flag == 0)
			flag = 1;
		else
			printf(" ");
		printf("%d %d", P->coef, P->expon);
		P = P->link;
	}
	printf("\n");
}

int main()
{
	Polynomial P1, P2, PP, PS;
	P1 = ReadPoly();
	P2 = ReadPoly();
	PP = Mult(P1, P2);
	PrintPoly(PP);
	PS = Add(P1, P2);
	PrintPoly(PS);
	return 0;
}

链表终于熟练了些，只不过要注意在乘法函数中的思想，先乘，再在结果多项式中比较指数大小决定放置or合并