2.5多项式的相加运算

作者：胡敬灏

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

typedef struct LinkNode
{
	int coefficient;
	int exponent;
	struct LinkNode *next;
}*LinkList,*NodePtr;
//Linklist是链表，NodePtr是结点

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

//print
void printList(LinkList paraHeader)
{
	NodePtr p =paraHeader->next;
	//paraHeader 有头结点
	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 paraCoefficent,int paraExponent)
{
	NodePtr p, q;
	//step 1.Construct a new node.
	q = (NodePtr)malloc(sizeof(struct LinkNode));
	q->coefficient = paraCoefficent;
	q->exponent = paraExponent;
	q->next = NULL;
		
		//step 2. 尾插
	p = paraHeader;
	while(p->next !=NULL)
	{
		p=p->next;
	}
	//step 3.
	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);//The second list is destroyed.
	//应该最后再来free掉头结点更合理！
	while((p!=NULL)&&(q!=NULL))
	{
		if(p->exponent<q->exponent)
		{
		//Link first
		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');老师代码，会导致链表断开
				 printf("case 3.1\r\n");
				    s = p;
				    r->next = p->next;  
				    p = p->next;        
				    free(s);           
				    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;}
	printf("Addition ends.\r\n");
}

int main()
{
	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");
	return 0;
}

​

运行结果：

1.多项式的相加运算实质上还是对链表结构的应用，换句话说，是对链表插入和改变指针指向的应用。

2.该过程中有很多情况p，q比较大小等三个情况，容易写错，可在草稿上列出。

3.printNode是打印单个结点的函数

4.通过该学习，对链表的应用更加熟悉和得心应手，若是三个链表的相加减，甚至多个也可以能够实现