多项式相加（c语言数据结构）

小白123**

已于 2022-05-05 12:17:50 修改

阅读量1.1k

点赞数 2

分类专栏：数据结构（c语言）

于 2022-05-05 12:11:54 首次发布

本文链接：https://blog.csdn.net/awm123453/article/details/124585950

版权

数据结构 c语言开发语言

数据结构（c语言）专栏收录该内容

16 篇文章 1 订阅

订阅专栏

1、老师的代码如下：

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

/**
 * Print the list.
 * @param paraHeader 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;
	}// Of while
	printf("\r\n");
}// Of printList

/**
 * 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);
	}// Of while
}// Of printNode

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

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

	// Step 3. Now add/link.
	p->next = q;
}// Of appendElement

/**
 * Polynomial addition.
 * @param paraList1 The first list.
 * @param paraList2 The second list.
 */
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 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 = 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.
 */
void additionTest(){
	// 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);
	printList(tempList1);
}// Of additionTest

/**
 * The entrance.
 */
void main(){
	additionTest();
	printf("Finish.\r\n");
}// Of main

测试结果：

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 p is (3 * 10^1)
p = 7410736, q = 7410864
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 = 7410768, q = 7410896
case 2
The element of r is (22 * 10^7)
The element of q is (-9 * 10^8)
p = 7410768, q = 7410928
case 3
The coefficient is: 0.
case 3.1
The element of p is (5 * 10^17)
p = 7410800, q = 0
End of while.
Addition ends.
7 * 10^0 + 11 * 10^1 + 22 * 10^7 + 5 * 10^17 +
Finish.

2、代码块：

结构体

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

创建头结点（初始化）

LinkList initLinkList(){
	LinkList tempHeader = (LinkList)malloc(sizeof(struct LinkNode));//分配空间 
	tempHeader->coefficient = 0;//初始系数为0 
	tempHeader->exponent = 0;//初始指数为0 
	tempHeader->next = NULL;
	return tempHeader;
}

打印

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

打印一个测试结点

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

在尾部插入

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 = p;
			p = p->next;
		} 
		else if ((p->exponent > q->exponent)) 
		{
			printf("case 2\r\n");
			r->next = q;
			r = q;
			q = q->next;
		} 
		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;
				free(s);
			} 
			else 
			{
				printf("case 3.2\r\n");
				r = p;
				p = p->next;
			}
			s = q;
			q = q->next;
			free(s);
		}
		printf("p = %ld, q = %ld \n", p, q);
	} 
	printf("End of while.\n");

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

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

测试代码

void additionTest(){
	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);
	printList(tempList1);
}

3、图示：
在这里插入图片描述

4、完整代码：

#include <stdio.h>
#include <stdlib.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;//初始系数为0 
	tempHeader->exponent = 0;//初始指数为0 
	tempHeader->next = NULL;
	return tempHeader;
}

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

//打印一个测试结点 
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);
	}
}

//在尾部插入 
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 = p;
			p = p->next;
		} 
		else if ((p->exponent > q->exponent)) 
		{
			printf("case 2\r\n");
			r->next = q;
			r = q;
			q = q->next;
		} 
		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;
				free(s);
			} 
			else 
			{
				printf("case 3.2\r\n");
				r = p;
				p = p->next;
			}
			s = q;
			q = q->next;
			free(s);
		}
		printf("p = %ld, q = %ld \n", p, q);
	} 
	printf("End of while.\n");

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

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

//测试代码
void additionTest(){
	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);
	printList(tempList1);
}


void main(){
	additionTest();
	printf("Finish.\r\n");
}

测试结果：

7 * 10^0 + 3 * 10^1 + 9 * 10^8 + 5 * 10^0

8 * 10^1 + 22 * 10^7 + -9 * 10^0

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
p = 1578000, q = 1578128
case 3
The coefficient is: 11.
case 3.2
p = 1578032, q = 1578160
case 2
p = 1578032, q = 1578192
case 3
The coefficient is: 0.
case 3.1
p = 1578064, q = 0
End of while.
Addition ends.
7 * 10^0 + 11 * 10^1 + 22 * 10^7 + 5 * 10^0

Finish.

小白123**

关注

2
点赞
踩
10

收藏

觉得还不错? 一键收藏
打赏
0
评论
多项式相加（c语言数据结构）

1、老师的代码如下：#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, *N
复制链接

扫一扫