链表实现多项式加法 纯C实现

创链表->归并相加->去0

#include<stdio.h>
#include<stdlib.h>
typedef struct Node
{
	float coef;		//系数
	int exp;		//指数
	struct PNode *next;
}PNode;

//创建多项式，多项式为空返回false
void Create(PNode* La);
//打印多项式
void Display(const PNode* La);
//多项式加法
void Add(PNode* L1, PNode* L2, PNode* ans);


int main()
{
	//分配头结点并置next为空 
	PNode* La =(PNode* )malloc(sizeof(PNode));
	La->next=NULL;
	PNode* Lb =(PNode* )malloc(sizeof(PNode));
	Lb->next=NULL;
	PNode* ans =(PNode* )malloc(sizeof(PNode));
	ans->next=NULL;
	
	Create(La);
	Display(La);
	Create(Lb);
	Display(Lb);
	Add(La, Lb, ans);
	Display(ans);
}


void Create(PNode* La)
{
	PNode* p = La;
	int i = 1;
	while (1)
	{
		int exp;
		float coef;
		printf("请输入第%d项的系数和指数(0 0结束输入):\n", i);
		scanf("%f %d", &coef, &exp);
		if (coef == 0 && exp == 0)
		{
			break;
		}
		i++;

		//根据输入的数据生成结点。尾插法 
		PNode* q=(PNode* )malloc(sizeof(PNode));
		q->coef = coef, q->exp = exp;
		q->next = NULL;
		p->next = q;
		p = p->next;
	}
}

void Display(const PNode* La)
{
	La = La->next;
	int key = 0;
	//输出，首个元素不输出+号
	while (La)
	{
		if (key)
		{
			printf("+%fx^%d", La->coef, La->exp);
		}
		else
		{
			printf("%fx^%d", La->coef, La->exp);
			key = 1;
		}
		La = La->next;
	}
	printf("\n");
}


void Add(PNode* L1, PNode* L2, PNode* ans)
{

	L1 = L1->next;
	L2= L2->next;
	PNode* q = ans;
	while (L1&&L2)
	{
		PNode* p=(PNode* )malloc(sizeof(PNode));
		//指数相等，系数相加,否则取小的那个
		if (L1->exp == L2->exp)
		{
			p->coef = L1->coef + L2->coef;
			p->exp = L1->exp;
			L1 = L1->next;
			L2 = L2->next;
		}
		else if (L1->exp < L2->exp)
		{
			p->coef = L1->coef;
			p->exp = L1->exp;
			L1 = L1->next;
		}
		else
		{
			p->coef = L2->coef;
			p->exp = L2->exp;
			L2 = L2->next;
		}
		//系数不为0才存入结果链表
		if (p->coef != 0)
		{
			q->next = p;
			q = q->next;
		}	
	}
	//没有遍历完的链表直接插入尾部
	q->next = L1 ? L1 : L2;
}