数据结构作业5：多项式的加法

一.代码如下

#include<stdio.h>
#include<malloc.h>

typedef struct LinkNode {
	int coefficient;
	int exponent;
	struct LinkNode* next;
}*LinkList,*NodePtr;

//初始化链表
LinkList initLinkList() {
	LinkList tempHeader = (LinkList)malloc(sizeof(struct LinkNode));
	tempHeader->coefficient = 0;
	tempHeader->exponent = 0;
	tempHeader->next = NULL;
	return tempHeader;
}

//打印链表
void printList(LinkList paraHeader) {
	NodePtr p = paraHeader->next;
	while (p != NULL) {
		printf("%d*x^%d+", p->coefficient, p->exponent);
		p = p->next;
	}
	printf("\r\n");
}

//打印一个结点用来测试
void printNode(NodePtr paraPtr, char paraChar) {
	if (paraPtr == NULL) {
		printf("NULL\r\n");
	}
	else {
		printf("The element of %c is (%d*x^%d+)\r\n", paraChar, paraPtr->coefficient, paraPtr->exponent);
	}
}

//增添一个元素在尾部
void appendElement(LinkList paraHeader, int paraCoefficient, int paraExponent) {
	NodePtr p, q;
	
	//第一步：创建一个新结点
	q = (NodePtr)malloc(sizeof(struct LinkNode));
	q->coefficient = paraCoefficient;
	q->exponent = paraExponent;
	q->next = NULL;

	//第二步：找到尾部
	p = paraHeader;
	while (p->next != NULL) {
		p = p->next;
	}

	//第三步：连接
	p->next = q;
}

//多项式加法的具体操作
void add(NodePtr paraList1, NodePtr paraList2) {
	NodePtr p, q, r, s;
	
	p = paraList1->next;
	printNode(p, 'p');
	q = paraList2->next;
	printNode(q, 'q');
	r = paraList1;
	printNode(r, 'r');
	free(paraList2);

	while ((p != NULL) && (q != NULL)) {
		if (p->exponent < q->exponent) {
			printf("case 1\r\n");
			r->next = p; //没什么用但要存在的操作
			r = p;
			printNode(r, 'r');
			p = p->next;
			printNode(p, 'p');
		}
		else if (p->exponent > q->exponent) {
			printf("case2\r\n");
			r->next = q;//有用操作
			r = q;
			printNode(r, 'r');
			q = q->next;
			printNode(q, 'q');
		}
		else {
			printf("case3\r\n");
			p->coefficient = p->coefficient + q->coefficient;
			printf("The coefficient is:%d.\r\n", p->coefficient);
			if (p->coefficient == 0) {
				printf("case 3.1\r\n");
				s = p;
				p = p->next;
				printNode(p, 'p');
			}
			else {
				printf("case 3.2\r\n");
				r = p;
				printNode(r, 'r');
				p = p->next;
				printNode(p, 'p');
			}
			s = q;
			q = q->next;
			free(s);
		}

		printf("p=%p,q=%p\r\n", p, q);
	}

	printf("End of while.\r\n");

	if (p = NULL) {
		r->next = q;
	}
	else {
		r->next = p;
	}

	printf("Addition ends.\r\n");
}

//测试1

void additionTest1() {
	//第一步：初始化第一个多项式
	LinkList tempList1 = initLinkList();
	appendElement(tempList1, 7, 0);
	appendElement(tempList1, 3, 1);
	appendElement(tempList1, 9, 8);
	appendElement(tempList1, 5, 17);
	printList(tempList1);

	//第二步：初始化第二个多项式
	LinkList tempList2 = initLinkList();
	appendElement(tempList2, 8, 1);
	appendElement(tempList2, 22, 7);
	appendElement(tempList2, -9, 8);
	printList(tempList2);

	//第三步：将第一个多项式和第二个多项式相加
	add(tempList1, tempList2);
	printf("The result is:");
	printList(tempList1);
	printf("\r\n");
}

//测试2
void additionTest2() {
	//第一步：初始化第一个多项式
	LinkList tempList1 = initLinkList();
	appendElement(tempList1, 7, 0);
	appendElement(tempList1, 3, 1);
	appendElement(tempList1, 9, 8);
	appendElement(tempList1, 5, 17);
	printList(tempList1);

	//第二步：初始化第二个多项式
	LinkList tempList2 = initLinkList();
	appendElement(tempList2, 8, 1);
	appendElement(tempList2, 22, 7);
	appendElement(tempList2, -9, 10);
	printList(tempList2);

	//第三步：将第一个多项式和第二个多项式相加
	add(tempList1, tempList2);
	printf("The result is:");
	printList(tempList1);
	printf("\r\n");
}

int main() {
	additionTest1();
	additionTest2();
	printf("Finish.\r\n");
	return 0;
}

二.运行结果

三.画图