【数据结构】链表的应用：多项式的加法

通过链表来实现两个多项式的加法：

代码：

#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;
}// Of initLinkList

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

void printNode(NodePtr paraPtr, char paraChar)
{
	if (paraPtr == NULL)
	{
		printf("NULL\r\n");
	}
	else
	{
		printf("The element of %c is (%d * 10^%d)\r\n", paraChar, paraPtr->coefficient, paraPtr->exponent);
	}
}// Of printNode

void appendElement(LinkList paraHeader, int paraCoefficient, int paraExponent)
{
	NodePtr p, q;

	//Step 1: Construct a new node
	q = (NodePtr)malloc(sizeof(struct LinkNode));
	q->coefficient = paraCoefficient;
	q->exponent = paraExponent;
	q->next = NULL;

	//Step2: Search to the tail
	p = paraHeader;
	while (p->next != NULL)
	{
		p = p->next;
	}// Of while

	//Step 3: Now add/link
	p->next = q;

}// Of appendElement

void add(NodePtr paraList1, NodePtr paraList2)
{
	NodePtr p, q, r, s;
	
	// Step 1: Search to the position
	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)
		{
			//Link the current node of the first list
			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)
		{
			//Link the current node of the second list
			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");
			// Change the current node of the first list
			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;
			//printf("q is pointing to (%d,%d)\r\n", q->coefficient, q->exponent);
			free(s);
		}// Of if

		printf("p = %ld, q = %ld \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");
}// Of add

/*
* Unit test 1.
*/
void additionTest1()
{
	// 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, 8);
	printList(tempList2);
	
	//Step 3: Add them to the first
	add(tempList1, tempList2);
	printf("The result is: ");
	printList(tempList1);
	printf("\r\n");
}// Of additionTest1

/*
*Unit test 2.
*/
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

/*
* The entrance.
*/
int main()
{
	additionTest1();
	additionTest2();
	printf("Finish.\r\n");
	return 0;
}// Of main

运行结果：

代码解释

1. 首先是定义一个链表结点来存储每项多项式的coefficient系数和exponent指数
2. 初始化链表，它创建并返回一个链表的头节点，头节点的系数和指数都为0，指向下一个节点的指针为NULL
3. 在打印节点时，采用科学计数法的形式，即a*10^b的形式，其中a为系数，b为指数
4. void appendElement(LinkList paraHeader, int paraCoefficient, int paraExponent)该函数接受三个参数，第一个参数是目标链表的头结点指针，第二个参数是要添加的节点的系数，第三个参数是要添加的节点的指数。遍历整个链表，直到找到最后一个节点，然后将新节点链接到最后一个节点的next指针上，从而将其添加到链表中。
5. void add(NodePtr paraList1, NodePtr paraList2)
   实现多项式加法的函数，接收两个参数，分别是两个多项式的头结点指针。通过一系列的指针操作，实现将两个多项式相加，并将结果存储到第一个多项式的链表中。当节点的指数不同时，该函数会将节点指数小的那个链表节点链接到结果链表中，并通过改变指针的指向，更新链表遍历状态。当节点指数相同时，该函数会将两个节点的系数相加，并将结果存放到第一个节点的系数中。如果计算结果为0，则删除第一个节点，并释放第二个节点的内存，否则就更新指针继续遍历两个链表。