C 多项式相加(作业)

#include <stdio.h>
#include <stdlib.h>
typedef struct NODE
{
	int coef;
	int expn;
	struct NODE *next;
}node;

node *creat(node *p, int n);
node *addpolyn(node *pa, node *pb, node *p3);
void printpolyn(node *p);

int main()
{
	node *pa = NULL, *pb = NULL, *pc = NULL;
	int n1, n2;
	printf("请输入多项式a的项数\n");
	scanf("%d",&n1);
	pa = creat(pa, n1);

	printf("请输入多项式b的项数\n");
	scanf("%d", &n2);
	pb = creat(pb, n2);

	pc = addpolyn(pa, pb, pc);

	printpolyn(pc);

	return 0;
}

node *creat(node *p, int n)
{
	int i;
	node *pre, *q;
	p = (node*)malloc(sizeof(node));//头节点
	p->next = NULL;
	for (i = 0; i < n; i++) {
		printf("请输入第%d项系数和指数\n", i + 1);
		node *s = (node*)malloc(sizeof(node));//新节点
		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;
}

node *addpolyn(node *pa, node *pb, node *p3)
{
	node *p1 = pa->next, *p2 = pb->next, *t;
	int sum = 0;
	p3 = pa;//p3指向a链 相加后的链表 其头节点其实就是pa链的头节点

	while (p1&&p2) {
        if (p1->expn < p2->expn) {
            p3->next = p1;
			p3 = p1;
			p1 = p1->next;
		}
		else if (p1->expn == p2->expn) {
			sum = p1->coef + p2->coef;
			if (sum) {
				p1->coef = sum;
				p3->next = p1;
				p3 = p1;
				p1 = p1->next;

				t = p2;
				p2 = p2->next;
				free(t);
			}
			else {
				t = p1; p1 = p1->next; free(t);
				t = p2; p2 = p2->next; free(t);
			}
		}
		else {

			p3->next = p2;
			p3 = p2;
			p2 = p2->next;
		}

	}
	p3->next = p1 ? p1 : p2;

	//p3此时已经移到表尾或表尾前面某个节点，不指向头节点了
	//若直接返回p3，会漏打前面的 应使其重新指向相加后链表的头节点

    p3=pa;
	return p3;
}


void printpolyn(node *p)
{
	node *q = p->next;
	printf("系数  指数\n");

	while (q) {
		printf("%4d  %4d\n", q->coef, q->expn);
		q = q->next;
	}

}