浙江大学数据结构——多项式加法和乘法

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

设计函数分别求两个一元多项式的乘积与和。

输入格式:

输入分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

/*思路好想，不会的可以看视频；
  这里只给出代码，借鉴了老师的代码；
  */ 
#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;   //修改pRear值 
}
Polynomial readpoly()
{
	int n,c,e;
	Polynomial p,rear,t;
	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 add(Polynomial p1,Polynomial p2)
{
	Polynomial t1,t2,temp,front,rear;
	t1 = p1;t2 = p2;
	int sum;
	rear = (Polynomial)malloc(sizeof(struct PolyNode));
	front = rear;
	while(t1&&t2){
		if(t1->expon == t2->expon)
		{
			sum = t1->coef+t2->coef;
			if(sum) attach(sum,t1->expon,&rear);
			t1 = t1->link;
			t2 = t2->link;
		}
		else if(t1->expon > t2->expon)
		{
			attach(t1->coef,t1->expon,&rear);
			t1=t1->link;	
		}
		else 
		{
			attach(t2->coef,t2->expon,&rear);
			t2=t2->link;
		}
	}
	while(t1)
	{
		attach(t1->coef,t1->expon,&rear);
		t1=t1->link;
	}
	while(t2)
	{
		attach(t2->coef,t2->expon,&rear);
		t2=t2->link;
	}
	rear->link = NULL;
	temp = front;
	front = front->link;
	free(temp);
	return front;
 } 
Polynomial mult(Polynomial p1,Polynomial p2)
{
	Polynomial p,rear,t1,t2,temp;//t1，t2用来暂时替代p1,p2; 
	int c,e;
	if(!p1||!p2) return NULL;//p1或者p2为空时，返回空 
	t1 = p1; 
	t2 = p2;
	p = malloc(sizeof(struct PolyNode));
	p->link = NULL;
	rear = p;
	while(t2)        //先用p1的第一项乘以p2，得到p; 
	{
		attach(t1->coef*t2->coef,t1->expon+t2->expon,&rear);
		t2 = t2->link;	
	}
	t1 = t1->link;
	while(t1)
	{
		t2 = p2;    //初始化，保证每次从t2头部开始 
		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)  //如果相等，非0时，系数相加,为0时,删除掉该节点 
			{
				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;
} 
void Printpoly(Polynomial p)
{
	int flag = 0;
	if(!p) {
		printf("0 0\n");
		return ;
	}   //p为空是 
	while(p)
	{
		if(!flag) flag = 1;
		else printf(" ");//flag用来控制第一个数的空格，控制格式； 
		printf("%d %d",p->coef,p->expon);
		p=p->link;
	}
	printf("\n");
}
int main(int argc, char *argv[]) {
	Polynomial p1,p2,pp,ps;
	p1 = readpoly(); //读入两组数据 
	p2 = readpoly();
	pp = mult(p1,p2);//求乘积 
	Printpoly(pp);  //打印结果 
	ps = add(p1,p2);//求和 
	Printpoly(ps);
	return 0;
}