数据结构之一元多项式合并(c语言）

 一元多项式的运算（求和）

     输入：   （1）A(x) = 7 + 3x + 9x8 + 5x17      

                   （2）B(x) = 8x + 22x7 − 9x8

     输出：合并后： C(x) = 7 +11x + 22x7 + 5x17

源代码：

 

#include <stdio.h>
#include <stdlib.h>
typedef struct PNode {
	int coef;
	int expn;
	struct PNode *next;
}PNode, *Polynomial;

/*Function:创建多项式*/
Polynomial CreatePolyn(Polynomial  P) {
	Polynomial pre, q;
	int i,n;
	Polynomial s;
	printf("请输入要创建多项式的项数:");
	scanf("%d",&n);
	P = (Polynomial)malloc(sizeof(PNode));
	P->next = NULL;                      //创建头节点 
	for (i = 1; i <= n; i++) {
		s = (Polynomial)malloc(sizeof(PNode));//新结点 
		printf("请输入第%d项的系数和指数(系数，指数)：\n",i);
		scanf("%d,%d", &s->coef, &s->expn);
		pre = P;
		q = P->next;
		while (q && q->expn < s->expn) {
			pre = q;
			q = q->next;
		}
		s->next = q;
		pre->next = s;
	}
		return P;
}
/*Function:多项式合并*/
Polynomial AddPolyn(Polynomial Pa, Polynomial Pb) {
	Polynomial p1, p2, p3, r;
	int sum;
	p1 = Pa->next; p2 = Pb->next; p3 = Pa;
	while (p1 && p2) {               //p1,p2均不为空执行以下语句 
		if (p1->expn == p2->expn) {    //指数相等 
			sum = p1->coef + p2->coef;
			if (sum != 0) {                   //系数不为0          
				p1->coef = sum;
				p3->next = p1; p3 = p1;
				p1 = p1->next;
				r = p2; p2 = p2->next; free(r);
			}
			else {                       //系数为0 
				r = p1; p1 = p1->next; free(r);
				r = p2; p2 = p2->next; free(r);
			}
		}
		else if (p1->expn < p2->expn) {
			p3->next = p1;
			p3 = p1;
			p1 = p1->next;
		}
		else {
			p3->next = p2;
			p3 = p2;
			p2 = p2->next;
		}
	}
	p3->next = p1 ? p1 : p2;
	free(Pb);
	return Pa;
}
/*Function:打印多项式*/ 
void Print(Polynomial P1){
	Polynomial p=P1->next;
	printf("多项式为:");
	printf("C(x)=");
	while(p!=NULL){
		printf("+%dx^%d",p->coef,p->expn);
		p=p->next;
	}
	printf("\n");
}
/*主函数*/ 
void main() {
	PNode *P1, *P2;
	P1=CreatePolyn(P1);
	Print(P1);
	P2=CreatePolyn(P2);
	P1=AddPolyn(P1,P2);
	printf("合并后的多项式为:\n");
	Print(P1);

}

 

 

 

运行结果：