2.5多项式的加法

一、收获总结

算法思路:

两个指针P1和P2分别指向这两个多项式第一个结点，不断循环。

P1->expon==P2->expon:系数相加，若结果不为0，则作为结果多项式对应项的系数。同时，P1和P2都分别指向下一项;

P1->expon>P2->expon:将P1的当前项存入结果多项式，并使P1指向下一项;P1->expon<P2->expon:将P2的当前项存入结果多项式，并使P2指向下一项;当某一多项式处理完时，将另一个多项式的所有结点依次复制到结果多项式中去。

二、摘抄代码

摘抄的代码如下：

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

/**
 * Linked list of integers. 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;
  }// Of initLinkList
  
  /**
   * Print the list.
   * @param paraHeader The header of the list.
   */
   void printList(LinkList paraHeader){
   	NodePtr p = paraHeader->next;
   	while (p != NULL) {
   		printf("%d * 10^%d + ", p->coefficient, p->exponent);
   		p = p->next;
	   }// of while
	   printf("\r\n");
}// of printList

/**
 * Print one node for testing.
 * @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);
	 }// of while
 }// of printNode
 
 /**
  * Add an element to the tail.
  * @param paraCoefficient 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;
	  
	  // Step 1. Construct a new node.
	  q = (NodePtr)malloc(sizeof(struct LinkNode));
	  q->coefficient = paraCoefficient;
	  q->exponent = paraExponent;
	  q->next = NULL;
	  
	  //Step 2. Search to the tail.
	  p = paraHeader;
	  while (p->next != NULL) {
	  	p = p->next;
	  } //of while
	  
	  //Step 3. Now add/link.
	  p->next = q; 
  }// of appendElement
  
  /**
   * Polynomial addition
   * @param paraList1 The first list.
   * @param paraList2 The second list.
   */
void add(NodePtr paraList1, NodePtr paraList2){
	NodePtr p, q, r, s;
	
	// Step 1. Search to the position.
	p = paraList1->next;
	printNode(p, 'p');
	q = paraList2->next;
	printNode(q, 'q');
	r = paraList1; // Previous pointer for inserting.
	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 swcond 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 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');
				//free(s);
			} else {
				printf("case 3.2\r\n");
				r = p;
				printNode(r, 'r');
				p = p->next;
				printNode(p, 'p');
			}// of if
			s = q;
			q = q->next;
			// printf
			free(s);
			}// of if
			
			printf("p = %ld, q = %ld \r\n", p, q);
		}// of while
		printf("End of while.\r\n");
		
		if (p == NULL) {
			r->next = q;
		} else {
			r->next = p;
		}// of if
		
		printf("Addition ends.\r\n");
	}// of add
		
		/**
		 * Unit test 1.
		 */
		 void additionTest1(){
		 	// Step1. 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);
		 	
		 	//Step 2. Initialize the second polynomial.
		 	LinkList tempList2 = initLinkList();
		 	appendElement(tempList2, 8, 1);
		 	appendElement(tempList2, 22, 7);
		 	appendElement(tempList2, -9, 8);
		 	printList(tempList2);
		 	
		 	//Step 3. Add them to the first.
		 	add(tempList1, tempList2);
		 	printf("The result is: ");
		 	printList(tempList1);
		 	printf("\r\n");
		 }// of additionTest1
		 
		 /**
		  * Unit test 2.
		  */
		  void additionTest2(){
		// Step 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);
		 	
		 	//Step 2. Initialize the second polynomial.
		 	LinkList tempList2 = initLinkList();
		 	appendElement(tempList2, 8, 1);
		 	appendElement(tempList2, 22, 7);
		 	appendElement(tempList2, -9, 10);
		 	printList(tempList2);
		 	
		 	//Step 3. Add them to the first.
		 	add(tempList1, tempList2);
		 	printf("The result is: ");
		 	printList(tempList1);
		 	printf("\r\n");
		 }// of additionTest2
		 
		 /**
		  * The entrance.
		  */
		int main(){
			additionTest1();
			additionTest2();
			printf("Finish.\r\n");
			return 0;
		} //of main

三、运行结果

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 = 12915776, q = 12915904
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 = 12915808, q = 12915936
case 2
The element of r is (22 * 10^7)
The element of q is (-9 * 10^8)
p = 12915808, q = 12915968
case 3
The coefficient is : 0.
case 3.1
The element of p is (5 * 10^17)
p = 12915840, 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 = 12915968, q = 12916096
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 = 12916000, q = 12916128
case 2
The element of r is (22 * 10^7)
The element of q is (-9 * 10^10)
p = 12916000, q = 12916160
case 1
The element of r is (9 * 10^8)
The element of p is (5 * 10^17)
p = 12916032, q = 12916160
case 2
The element of r is (-9 * 10^10)
NULL
p = 12916032, 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.

三、收获心得

多项式的加法我认为是对单链表结构的一个基础的应用，只不过在链表中，多项式的加法会根据实际情况增加了一个数据的位置，因此来实现其相加。在这次抄写过程中，基本上报错时可以迅速找到问题的bug，进行修改，多是拼写错误，于是还是要细心再心细吧。