浙大pta：多项式相加 相乘

多项式相加 相乘

#include<stdio.h>
#include<stdlib.h>
typedef struct PolyNode *Polynomial;
struct PolyNode
{
	int coef;//系数
	int expon;//指数
	Polynomial link;//指向下一个节点的指针
};

//读入多项式
Polynomial ReadPoly();

//用来比较两项的系数
int compare(int cop1, int cop2);

//用来判断让两个多项式相加
Polynomial PolyAdd(Polynomial P1, Polynomial P2);

//相乘
Polynomial Mult(Polynomial P1, Polynomial P2);


//用来在尾部插入节点
void Attach(int c, int e, Polynomial *pRear);

//输出
void PrintPoly(Polynomial P);


/*
	@author : Mazeqi
	@Task：多项式相加相乘
*/


/*
  Description:相乘
*/
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));
	P->link = NULL;
	Rear = P;
	
	//先把t2的第一项跟t1所有的项相乘，构成一条基础链
	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;
			//找到比e小的位置
			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;

}

/*
   Description:相加
*/
Polynomial PolyAdd(Polynomial P1, Polynomial P2)
{
	Polynomial front, rear, temp;
	int sum;
	//头部使用空节点对两个多项式进行操作
	rear = (Polynomial)malloc(sizeof(struct PolyNode));
	front = rear;

	while (P1&&P2)
	{
		switch (compare(P1->expon,P2->expon))
		{

			//当p1指数大于p2
			case 1:
			{
				Attach(P1->coef,P1->expon,&rear);
				P1 = P1->link;
				break;
			}
			//当p2大于p1
			case -1:
			{
				Attach(P2->coef,P2->expon,&rear);
				P2 = P2->link;
				break;
			}
			//两者相等
			case 0:
			{
				//两个相等的时候系数要相加
				sum = P1->coef + P2->coef;
				if (sum)
				{
					Attach(sum,P1->expon,&rear);
				}
				P1 = P1->link;
				P2 = P2->link;
				break;
			}

		}
	}
	//把p1剩下的项全都搞进去
	for (; P1 != NULL; P1 = P1->link)Attach(P1->coef, P1->expon, &rear);
	for (; P2 != NULL; P2 = P2->link)Attach(P2->coef, P2->expon, &rear);

	rear->link = NULL;//尾部节点置空
	
	//把空头节点去掉
	temp = front;
	front = front->link;
	free(temp);

	return front;
}

/*
  Description:用来比较两项的指数
*/
int compare(int cop1, int cop2)
{
	if (cop1 > cop2)
	{
		return 1;
	}
	else if (cop2 > cop1)
	{
		return -1;
	}
	else if (cop1 == cop2)
	{
		return 0;
	}
		 
}

/*
   Description:读入多项式
*/
Polynomial ReadPoly()
{
	int N;
	scanf("%d",&N);

	//系数与指数
	int c, e;

	//尾指针
	Polynomial Rear,P,t;

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

/*
  Description:输出函数
*/

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");

}

/*
 @ Description:尾插构建新的多项式
 @param pRear:尾节点
*/
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;
}
int main()
{
	//初始化两个多项式
	Polynomial P1 = ReadPoly();
	Polynomial P2 = ReadPoly();
	Polynomial pmult=Mult( P1, P2);
    PrintPoly(pmult);

	//进行加法运算
	Polynomial padd = PolyAdd(P1, P2);


	//输出
	PrintPoly(padd);

	system("pause");
	return 0;
}