多项式的加法-链表的基本应用

代码：

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

	}//of while
}
//增添元素
void appendElement(LinkList paraHeader, int paraCoefficient, int paraExponent)
{
	NodePtr p, q;
	//1,创建一个新结点
	q = (NodePtr)malloc(sizeof(struct LinkNode));
	q->coefficient = paraCoefficient;
	q->exponent = paraExponent;
	q->next = NULL;
	//2.找到尾部
	p = paraHeader;
	while (p->next != NULL)
	{
		p = p->next;
	}
	//3.连接
	p->next = q;
}
//多项式相加
void add(NodePtr paraList1, NodePtr paraList2)
{
	NodePtr p, q, r, s;
	//1.找位置
	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("case 2\r\n");
			r->next = q;
			r = q;
			printNode(r, 'r');
			q = q->next;
			printNode(q, 'q');
		}
		else{
			printf("case 3\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');
				free(s);
			}
			else
			{
				printf("case 3.2\r\n");
				r = p;
				printNode(r, 'r');
				p = p->next;
				printNode(p, 'p');
			}//of if
			s = q;
			q = q->next;
			free(s);
		}//of if
		printf("p=%p,q=%p\r\n", p, q);
	}//of while
	printf("End of while.\r\n");
	if (p == NULL)
	{
		r->next = q;
	}else
{
		r->next = p;
}//of if
	printf("Addition ends.\r\n");
}
void additionTest1(){
	//1.初始化第一个多项式
	LinkList tempList1 = initLinkList();
	appendElement(tempList1, 7, 0);
	appendElement(tempList1, 3, 1);
	appendElement(tempList1, 9, 8);
	appendElement(tempList1, 5, 17);
	printList(tempList1);

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

	//3.相加
	add(tempList1, tempList2);
	printf("The result is: ");
	printList(tempList1);
	printf("\r\n");
}// Of additionTest1
void additionTest2(){
	// Step 1. Initialize the first polynomial.
	LinkList tempList1 = initLinkList();
	appendElement(tempList1, 7, 0);
	appendElement(tempList1, 3, 1);
	appendElement(tempList1, 9, 8);
	appendElement(tempList1, 5, 17);
	printList(tempList1);

	// Step 2. Initialize the second polynomial.
	LinkList tempList2 = initLinkList();
	appendElement(tempList2, 8, 1);
	appendElement(tempList2, 22, 7);
	appendElement(tempList2, -9, 10);
	printList(tempList2);

	// Step 3. Add them to the first.
	add(tempList1, tempList2);
	printf("The result is: ");
	printList(tempList1);
	printf("\r\n");
}// Of additionTest2
int main()
{
	additionTest1();
	additionTest2();
	printf("Finish.\r\n");
	return 0;
}

结果：