多项式的加法

创建结点

        我们用链表存储一个多项式，那么该链表的每一个结点就代表多项式的某一项。所以我们的每一个结点必须包含三个信息：多项式的系数、多项式的指数以及指向下一个结点的指针。

typedef struct LinkNode
{
	int coefficient;			//系数
	int exponent;				//指数
	struct LinkNode* next;
} *LinkList, *NodePtr;

多项式相加

        从两个待相加的多项式的表头开始，比较两个结点的指数大小，若相同，则将两个结点的系数相加得到新的系数。

void add(NodePtr paraList1, NodePtr paraList2)
{
	NodePtr p, q, r, s;

	//1.Search to the position.
	p = paraList1->next;
	printNode(p, 'p');
	q = paraList2->next;
	printNode(q, 'q');
	r = paraList1; //Previous pointer for inserting.
	printNode(r, 'r');
	free(paraList2); // The second list is destroyed.

	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');
			}
			s = q;
			q = q->next;
			//printf("q is pointing to (%d, %d)\r\n",q->coefficient,q->exponent);
			free(s);
		}

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

整体代码

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

/*
* Linked list of integers. The key is data. The key is sorted in non-descending order.
 */

typedef struct LinkNode
{
	int coefficient;			//系数
	int exponent;				//指数
	struct LinkNode* next;
} *LinkList, *NodePtr;

/*
* Initialize the list with a header.
* @return The pointer to the header.
*/

LinkList initLinkList()
{
	LinkList tempHeader = (LinkList)malloc(sizeof(struct LinkNode));
	tempHeader->coefficient = 0;
	tempHeader->exponent = 0;
	tempHeader->next = NULL;
	return tempHeader;
}

/*
* Print the list.
* @param paraHeader The header of the list.
*/

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

/*
* Print one node for testing.
* @param paraPtr The pointer to the node.
* @param paraChar The name of the node.
*/

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

/*
* Add an element to the tail.
* @param paraCoefficient The coefficient of the new element.
* @param paraExponent The exponent of the new element.
*/

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

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

	//2.Search to the tail.
	p = paraHeader;
	while (p->next != NULL)
	{
		p = p ->next;
	}

	//3.Now add.
	p->next = q;
}

/*
* Polynomial addition.
* @param paraList1 The first list.
* @param paraList2 The second list.
*/

void add(NodePtr paraList1, NodePtr paraList2)
{
	NodePtr p, q, r, s;

	//1.Search to the position.
	p = paraList1->next;
	printNode(p, 'p');
	q = paraList2->next;
	printNode(q, 'q');
	r = paraList1; //Previous pointer for inserting.
	printNode(r, 'r');
	free(paraList2); // The second list is destroyed.

	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');
			}
			s = q;
			q = q->next;
			//printf("q is pointing to (%d, %d)\r\n",q->coefficient,q->exponent);
			free(s);
		}

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

/*
* Unit test 1.
*/

void additionTest1()
{
	//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);

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

	//3.Add them to the first.
	add(tempList1, tempList2);
	printf("The result is: ");
	printList(tempList1);
	printf("\r\n");
}

/*
* Unit test 2.
*/

void additionTest2()
{
	//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);

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

	//3.Add them to the first.
	add(tempList1, tempList2);
	printf("The result is: ");
	printList(tempList1);
	printf("\r\n");
}

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

运行结果