数据结构-多项式求和

定义结构体

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

初始化

LinkList iniLinkList(){
	LinkList tempHeader = (LinkList)maiioc(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 * 10^%d + ",p->coefficient,p->exponent);
		p = p->next;
	}
	printf("rn");
}

打印节点

void printNode(NodePtr paraPtr,char paraChar){
	if (paraPtr == NULL){
		printf("NULLrn");
	}else{
		printf("The element of %c is (%d * 10^%D)rn",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 1rn");
			r = p;
			printNode(r,'r');
			p = p->next;
			printNode(p,'p');
		}else if((p->exponent>q->exponent)){
			
			printf("case 2rn");
			r->next = q;
			r = q;
			printNode(r,'r');
			q = q->next;
			printNode(q,'q');
		}else{
			printf("case 3rn");
			
			p->coefficient =p->coefficient + q->coefficient;
			printf("The coefficient is: %d.rn",p->coefficient);
			if(p->coefficient == 0){
				printf("case 3..1rn");
				s = p;
				p = p->next;
				printNode(p,'p');
				 
			}else{
				printf("case 3.2rn");
				r = p;
				printNode(r,'r');
				p = p->next;
				printNode(p,'p');
			}
			s = q;
			q = q->next;
			
			free(s);
		}
		
		printf("p = %d,q = %ld rn",p,q);
	}
	printf("End of while.rn");
	
	if (p == NULL){
		r->next = q;
	}else {
		r->next = p;
	}
	
	printf("Addition ends.rn");
}

测试

void additionTest(){
	
	LinkList tempList = iniLinkList();
	appendElement(tempList1, 7, 0);
	appendElement(tempList1, 3, 1);
	appendElement(tempList1, 9, 8);
	appendElement(tempList1, 5, 17);
	printList(tempList);
	
	
	LinkList tempList2 = iniLinkList();
	appendElement(tempList2, 8, 1);
	appendElement(tempList2, 22, 7);
	appendElement(tempList2, -9, 8);
	printList(tempList2);
	
	
	add(tempList1,tempList2);
	printList(tempList1);
}

 总代码

#include  
#include 

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


LinkList iniLinkList(){
	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 * 10^%d + ",p->coefficient,p->exponent);
		p = p->next;
	}
	printf("rn");
}


void printNode(NodePtr paraPtr,char paraChar){
	if (paraPtr == NULL){
		printf("NULLrn");
	}else{
		printf("The element of %c is (%d * 10^%D)rn",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 1rn");
			r = p;
			printNode(r,'r');
			p = p->next;
			printNode(p,'p');
		}else if((p->exponent>q->exponent)){
			
			printf("case 2rn");
			r->next = q;
			r = q;
			printNode(r,'r');
			q = q->next;
			printNode(q,'q');
		}else{
			printf("case 3rn");
			
			p->coefficient =p->coefficient + q->coefficient;
			printf("The coefficient is: %d.rn",p->coefficient);
			if(p->coefficient == 0){
				printf("case 3..1rn");
				s = p;
				p = p->next;
				printNode(p,'p');
				 
			}else{
				printf("case 3.2rn");
				r = p;
				printNode(r,'r');
				p = p->next;
				printNode(p,'p');
			}
			s = q;
			q = q->next;
			
			free(s);
		}
		
		printf("p = %d,q = %ld rn",p,q);
	}
	printf("End of while.rn");
	
	if (p == NULL){
		r->next = q;
	}else {
		r->next = p;
	}
	
	printf("Addition ends.rn");
}


void additionTest(){
	
	LinkList tempList = iniLinkList();
	appendElement(tempList1, 7, 0);
	appendElement(tempList1, 3, 1);
	appendElement(tempList1, 9, 8);
	appendElement(tempList1, 5, 17);
	printList(tempList);
	
	
	LinkList tempList2 = iniLinkList();
	appendElement(tempList2, 8, 1);
	appendElement(tempList2, 22, 7);
	appendElement(tempList2, -9, 8);
	printList(tempList2);
	
	
	add(tempList1,tempList2);
	printList(tempList1);
}

void main(){
	additionTest();
	printf("Finish.rn");
}

运行结果