2.4多项式加法

huge6666668

于 2024-04-25 17:45:33 发布

阅读量146

点赞数 2

文章标签：算法

本文链接：https://blog.csdn.net/huge6666668/article/details/138195826

版权

本文介绍了一个使用C语言编写的链表结构，用于表示多项式表达式，并提供了初始化、打印和多项式加法功能。两个示例展示了如何使用这些函数对多项式进行相加。

摘要由CSDN通过智能技术生成

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

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

void additionTest1(){

	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);
	printf("The result is: ");
	printList(tempList1);
	printf("\r\n");
}
void additionTest2(){

	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, 10);
	printList(tempList2);


	add(tempList1, tempList2);
	printf("The result is: ");
	printList(tempList1);
	printf("\r\n");
}
int main(){
	additionTest1();
	additionTest2();
	printf("Finish.\r\n");
	return 0;
}