数据结构-多项式加法

最新推荐文章于 2024-09-28 23:13:10 发布

夏天热不死

最新推荐文章于 2024-09-28 23:13:10 发布

阅读量207

点赞数 3

文章标签：数据结构链表

本文链接：https://blog.csdn.net/2302_80798252/article/details/138197486

版权

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

typedef struct LinkNode
{
	int coe;
	int exp;
	struct LinkNode *next;
} *LinkList,*NodePtr;

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

void printList(LinkList paraHeader)
{
	NodePtr p=paraHeader->next ;
	while(p!=NULL)
	{
		printf("%d * x^%d + ",p->coe ,p->exp );
		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->coe ,paraPtr->exp );
	}
}

void appendElement(LinkList paraHeader,int paraCoe,int paraExp)
{
	NodePtr p,q;
	
	q=(NodePtr)malloc(sizeof(struct LinkNode));
	q->coe =paraCoe;
	q->exp =paraExp;
	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->exp <q->exp )
		{
			printf("case 1\r\n");
			r->next =p;
			r=p;
			printNode(r,'r');
			p=p->next ;
			printNode(p,'p');
		}
		else if((p->exp >q->exp ))
		{
			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->coe =p->coe +q->coe ;
			printf("The coeffficient is: %d.\r\n",p->coe );
			if(p->coe ==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->coe ,q->exp );
			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;
	}
	
	printf("Addition ends.\r\n");
}

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,8);
	printList(tempList2);
	
	add(tempList1,tempList2);
	printf("The result is: ");
	printList(tempList1);
	printf("\r\n");
}

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