多项相加的学习

将两个多项式的幂从小到大输入（本次代码只支持多项式的幂从小到大的相加）难点就是要考虑好相加的多种情形，以及结点的连接和释放。

将多项式数字化

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

链表的初始化

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

链表的增添

void appendElement(NodePtr paraHeader,int paraCofficient,int paraExponent){
	NodePtr p,q;
	p = paraHeader;
	while(p->next!=NULL){
		p = p->next;
	}

    q = (NodePtr)malloc(sizeof(struct LinkNode));
    q->coefficient = paraCofficient;
    q->exponent = paraExponent;
    q->next = NULL;
	
	p->next = q;
}

 两个多项式的相加的四种情况，这里要注意每次比较以后都要将新链表的最后一个结点指向幂小的那个结点，幂相等时指向被保存的那个链表。具体理解请结合代码和自己画图理解，光看可能有点模糊

void add(NodePtr paraList1,NodePtr paraList2){
	NodePtr p,q,r,s;
	p = paraList1->next;
	q = paraList2->next;
	r = paraList1;
	free(paraList2);
	
	while(p!=NULL && q!=NULL){
		if(p->exponent  > q->exponent  ){
			r->next  = q;
			r = q;
			q = q->next;
		}
		else if(p->exponent < q->exponent ){
			r->next = p;
			r = p;
			p = p->next;
		}else{
			p->coefficient = p->coefficient + q->coefficient;
			if(p->coefficient == 0){
				s = p;
				p = p->next;
				free(s);
			}else{
				r->next = p;
				r = p;
				p = p->next;
			}
			s = q;
			q = q->next;
			free(s); 
		}
	}
	if(p==NULL){
		r->next = q;
	}else{
		r->next = p; 
	}
}

完整代码

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

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

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

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

void appendElement(NodePtr paraHeader,int paraCofficient,int paraExponent){
	NodePtr p,q;
	p = paraHeader;
	while(p->next!=NULL){
		p = p->next;
	}

    q = (NodePtr)malloc(sizeof(struct LinkNode));
    q->coefficient = paraCofficient;
    q->exponent = paraExponent;
    q->next = NULL;
	
	p->next = q;
}

void add(NodePtr paraList1,NodePtr paraList2){
	NodePtr p,q,r,s;
	p = paraList1->next;
	q = paraList2->next;
	r = paraList1;
	free(paraList2);
	
	while(p!=NULL && q!=NULL){
		if(p->exponent  > q->exponent  ){
			r->next  = q;
			r = q;
			q = q->next;
		}
		else if(p->exponent < q->exponent ){
			r->next = p;
			r = p;
			p = p->next;
		}else{
			p->coefficient = p->coefficient + q->coefficient;
			if(p->coefficient == 0){
				s = p;
				p = p->next;
				free(s);
			}else{
				r->next = p;
				r = p;
				p = p->next;
			}
			s = q;
			q = q->next;
			free(s); 
		}
	}
	if(p==NULL){
		r->next = q;
	}else{
		r->next = p; 
	}
}

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

	add(tempList1, tempList2);
	printList(tempList1);
}// Of additionTest


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

测试结果