#include<stdio.h>
#include<malloc.h>
//Linked list of the integers.The key is data. The key is sorted in non-descending(降序) order.
typedef struct LinkNode{
int coefficient;//系数
int exponent;//指数
struct LinkNode *next;
}*LinkList, *NodePtr;
/*Initialize the list with a header.
*return the pointer to the header.
*/
LinkList initLinkList(){
LinkList tempHeader = (LinkList)malloc(sizeof(struct LinkNode));
tempHeader->coefficient = 0;
tempHeader->exponent = 0;
tempHeader->next = NULL;
return tempHeader;
}//off init.
/*Print the list.
*param paraHeader the header to the list.
*/
void printList(LinkList paraHeader){
NodePtr p = paraHeader->next;
while (p != NULL){
printf("%d * 10^%d + ",p->coefficient,p->exponent);
p = p->next;
}//off while
printf("\r\n");
}// off print
/*print one node to test
*param paraPtr the pointer to the node.
*param paraChar the name of the node.
*/
void printNode(NodePtr paraPtr,char paraChar){
if(paraPtr == NULL){
printf("NULL\r\n");
}
else{
printf("The element of %c is (%d * 10^%d)\r\n",paraChar, paraPtr->coefficient,paraPtr->exponent);
}//off if
}//off printNode.
/*Add an element to the tail.
*param paraCoeffcient the coefficient of the new element.
*param paraExponent the exponent of the new element.
*/
void appendElement(LinkList paraHeader,int paraCoefficient,int paraExponent){
NodePtr p,q;
//1.Construct a new node.
q = (NodePtr)malloc(sizeof(struct LinkNode));
q->coefficient = paraCoefficient;
q->exponent = paraExponent;
q->next = NULL;
//2.Search to the tail.
p = paraHeader;
while(p->next != NULL){
p = p->next;
}//off while.
//3.link
p->next = q;
}//off appendElement
/*Polynomial addition多项式加法
*param paraList1 the first list
*param paraList2 the second list.
*/
void add(NodePtr paraList1, NodePtr paraList2){
NodePtr p,q,r,s;
//1.search to the position
p = paraList1->next;
printNode(p, 'p');
q = paraList2->next;
printNode(q, 'q');
r = paraList1;
printNode(r ,'r');
free(paraList2); //the second list is destroyed.
while ((p != NULL) && (q != NULL)){
if(p->exponent < q->exponent){
//Link the current node of the first list.
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){
//Link the current node of the second list.
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");
//change the current node of the first list.
p->coefficient = p->coefficient + q->coefficient;
printf("The cofficient is: %d.\r\n", p->coefficient);
if(p->coefficient == 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->coefficient, q->exponent);
free(s);
}//off if
printf("p = %ld, q = %ld\r\n",p, q);
} //off while
printf("End of while.\r\n");
if(p == NULL){
r->next = q;
}
else{
r->next = p;
}//off if
printf("Addition ends.\r\n");
} //off add.
void additionTest1(){
//1.initialize the first polynomial.
LinkList tempList1 = initLinkList();
appendElement(tempList1, 7, 0);
appendElement(tempList1, 3, 1);
appendElement(tempList1, 9, 8);
appendElement(tempList1, 5, 17);
printList(tempList1);
//2.Initialize the second polynomial.
LinkList tempList2 = initLinkList();
appendElement(tempList2, 8, 1);
appendElement(tempList2, 22, 7);
appendElement(tempList2, -9, 8);
printList(tempList2);
//3.Add them to the first
add(tempList1, tempList2);
printf("The result is: ");
printList(tempList1);
printf("\r\n");
}//off test1.
//Unit test 2
void additionTest2(){
//1.Initialize the first polynomial.
LinkList tempList1 = initLinkList();
appendElement(tempList1, 7, 0);
appendElement(tempList1, 3, 1);
appendElement(tempList1, 9, 8);
appendElement(tempList1, 5, 17);
printList(tempList1);
//2.Initialize the second polynomial.
LinkList tempList2 = initLinkList();
appendElement(tempList2, 8, 1);
appendElement(tempList2, 22, 7);
appendElement(tempList2, -9, 10);
printList(tempList2);
//3.add
add(tempList1,tempList2);
printf("The result is: ");
printList(tempList1);
printf("\r\n");
}//off test2.
int main(){
additionTest1();
additionTest2();
printf("Ending...\n");
getchar();
return 0;
}
运行结果
7 * 10^0 + 3 * 10^1 + 9 * 10^8 + 5 * 10^17 +
8 * 10^1 + 22 * 10^7 + -9 * 10^8 +
The element of p is (7 * 10^0)
The element of q is (8 * 10^1)
The element of r is (0 * 10^0)
case 1
The element of r is (7 * 10^0)
The element of p is (3 * 10^1)
p = 7542496, q = 7542752
case 3
The coefficient is: 11.
case 3.2
The element of r is (11 * 10^1)
The element of p is (9 * 10^8)
p = 7542560, q = 7542816
case 2
The element of r is (22 * 10^7)
The element of q is (-9 * 10^8)
p = 7542560, q = 7542880
case 3
The coefficient is: 0.
case 3.1
The element of p is (5 * 10^17)
p = 7542624, q = 0
End of while.
Addition ends.
The result is: 7 * 10^0 + 11 * 10^1 + 22 * 10^7 + 5 * 10^17 +
7 * 10^0 + 3 * 10^1 + 9 * 10^8 + 5 * 10^17 +
8 * 10^1 + 22 * 10^7 + -9 * 10^10 +
The element of p is (7 * 10^0)
The element of q is (8 * 10^1)
The element of r is (0 * 10^0)
case 1
The element of r is (7 * 10^0)
The element of p is (3 * 10^1)
p = 7542880, q = 7543136
case 3
The coefficient is: 11.
case 3.2
The element of r is (11 * 10^1)
The element of p is (9 * 10^8)
p = 7542944, q = 7543200
case 2
The element of r is (22 * 10^7)
The element of q is (-9 * 10^10)
p = 7542944, q = 7543264
case 1
The element of r is (9 * 10^8)
The element of p is (5 * 10^17)
p = 7543008, q = 7543264
case 2
The element of r is (-9 * 10^10)
NULL
p = 7543008, q = 0
End of while.
Addition ends.
The result is: 7 * 10^0 + 11 * 10^1 + 22 * 10^7 + 9 * 10^8 + -9 * 10^10 + 5 * 10^17 +
Finish.