多项式加法

TT@

已于 2023-06-12 12:23:26 修改

阅读量77

点赞数

文章标签： c语言算法数据结构

于 2023-04-10 22:43:27 首次发布

本文链接：https://blog.csdn.net/2301_77021712/article/details/130071749

版权

这是一段C语言代码，它实现了对两个多项式进行加法运算，并将结果存储在第一个多项式中。多项式中的每一项都包含一个系数和指数，这里使用链表来存储多项式中的每一项。

函数`initLinkList()`创建一个初始化的链表并返回一个指向头节点的指针。

函数`printList()`打印链表中的所有项。

`appendElement()`函数将一个新项附加到链表的末尾。

`add()`函数实现了多项式的加法运算。它包含三个参数：两个多项式的头指针和一个结果多项式的头指针。它使用两个指针来遍历两个多项式，比较当前指向的项的指数大小，并将较小的项链接到最终结果多项式中的上一个位置。如果两个项的指数相等，则将它们的系数相加，并删除其中一个项（如果系数为0）。

`additionTest1()`和`additionTest2()`函数是对`add()`函数的测试。其中`additionTest1()`测试了两个多项式中都存在的项（即指数0、1和8），而`additionTest2()`测试了多项式中不存在的项（即指数为10）。

代码如下：

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

/*
* Linked list of intergers.The key is data.The key is sored in nin-descending oeder.
*/
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;
}

/*
* printf the list.
* @param paeaHeader the header of the list.
*/
void printList(LinkList paraHeader) {
	NodePtr p = paraHeader->next;
	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 paraCoefficent the coefficent of the new element.
* @param paraExponent the exponent of the new element. 
*/
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;

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

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

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;//Previous pointer for insreting.
	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(r, 'r');
		}
		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);
		}//of if
		printf("p=%ld,q=%ld\r\n", p, q);
	}//of while
	printf("End of the while.\r\n");

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

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

/*
* unit test 1.
*/
void additionTest1() {
	//step 1.initialize the first polinomial.
	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");

}

/*
* 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");

}

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

7*10^0+3*10^1+9*10^8+5*10^17+
8*10^1+22*10^7+-9*10^8+
The element of p is(7*10^0)
The element of q is(8*10^1)
The element of r is(0*10^0)
case 1
The element of r is(7*10^0)
The element of r is(7*10^0)
p=-1965084432,q=-1965083392
case 3
The coefficient is:11.
case 3.2
The element of r is(11*10^1)
The element of p is(9*10^8)
p=-1965083072,q=-1965082832
case 2
The element of r is(22*10^7)
The element of q is(-9*10^8)
p=-1965083072,q=-1965082752
case 3
The coefficient is:0.
case 3.1
The element of p is(5*10^17)
p=-1965082992,q=0
End of the while.
Addition ends.
The result is:7*10^0+11*10^1+22*10^7+5*10^17+

7*10^0+3*10^1+9*10^8+5*10^17+
8*10^1+22*10^7+-9*10^10+
The element of p is(7*10^0)
The element of q is(8*10^1)
The element of r is(0*10^0)
case 1
The element of r is(7*10^0)
The element of r is(7*10^0)
p=-1965082752,q=-1965083472
case 3
The coefficient is:11.
case 3.2
The element of r is(11*10^1)
The element of p is(9*10^8)
p=-1965083232,q=-1965083792
case 2
The element of r is(22*10^7)
The element of q is(-9*10^10)
p=-1965083232,q=-1965084112
case 1
The element of r is(9*10^8)
The element of r is(9*10^8)
p=-1965084352,q=-1965084112
case 2
The element of r is(-9*10^10)
NULL
p=-1965084352,q=0
End of the while.
Addition ends.
The result is:7*10^0+11*10^1+22*10^7+9*10^8+-9*10^10+5*10^17+

Finish.

D:\数据算法\多项式加法\x64\Debug\多项式加法.exe (进程 35976)已退出，代码为 0。
按任意键关闭此窗口. . .