2.5多项式的加法

一、代码

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




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





LinkList initLinkList(){
	LinkList tempHeader = (LinkList)malloc(sizeof(struct LinkNode));
	tempHeader->cofficient = 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->cofficient, 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->cofficient, paraPtr->exponent);
	}
}






void appendElement(LinkList paraHeader, int paraCoefficient, int paraExponent){
	NodePtr p,q;
	
	
	q = (NodePtr)malloc(sizeof(struct LinkNode));
	q->cofficient = 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->cofficient = p->cofficient + q->cofficient;
			printf("The coefficient is: %d.\r\n",p->cofficient);
			if(p->cofficient == 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;
	}
	
	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, 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;
}

二、运行结果

7 * x^0 + 3 * x^1 + 9 * x^8 + 5 * x^17 +
8 * x^1 + 22 * x^7 + -9 * x^8 +
The element of p is (7 * x^0)
The element of q is (8 * x^1)
The element of r is (0 * x^0)
case 1
The element of r is (7 * x^0)
The element of p is (3 * x^1)
p = 0000000000751450, q = 0000000000756BF0
case 3
The coefficient is: 11.
case 3.2
The element of r is (11 * x^1)
The element of p is (9 * x^8)
p = 0000000000751470, q = 0000000000756C10
case 2
The element of r is (22 * x^7)
The element of q is (-9 * x^8)
p = 0000000000751470, q = 0000000000756C30
case 3
The coefficient is: 0.
case 3.1
The element of p is (5 * x^17)
p = 0000000000751490, q = 0000000000000000
End of while.
Addition ends.
The result is: 7 * x^0 + 11 * x^1 + 22 * x^7 + 5 * x^17 +

7 * x^0 + 3 * x^1 + 9 * x^8 + 5 * x^17 +
8 * x^1 + 22 * x^7 + -9 * x^10 +
The element of p is (7 * x^0)
The element of q is (8 * x^1)
The element of r is (0 * x^0)
case 1
The element of r is (7 * x^0)
The element of p is (3 * x^1)
p = 0000000000756C30, q = 0000000000756CB0
case 3
The coefficient is: 11.
case 3.2
The element of r is (11 * x^1)
The element of p is (9 * x^8)
p = 0000000000756C50, q = 0000000000756CD0
case 2
The element of r is (22 * x^7)
The element of q is (-9 * x^10)
p = 0000000000756C50, q = 0000000000756CF0
case 1
The element of r is (9 * x^8)
The element of p is (5 * x^17)
p = 0000000000756C70, q = 0000000000756CF0
case 2
The element of r is (-9 * x^10)
NULL
p = 0000000000756C70, q = 0000000000000000
End of while.
Addition ends.
The result is: 7 * x^0 + 11 * x^1 + 22 * x^7 + 9 * x^8 + -9 * x^10 + 5 * x^17 +

finish.