2.4多项式的加法

代码

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

/**
  * linked list of 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; 
  }//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 code.
  	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 foe intersting.
  	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 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("q is pointing to (%d, %d)\r\n",q->coefficient, q->exponent);
			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() {
  	//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, 8);
  	printList(tempList2);
  	
  	//Step 3. Add them to the first.
	add(tempList1, tempList2);
	printf("The result is: ");
	printList(tempList1);
	printf("\r\n"); 
  }//Od 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 = 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.

心得体会

代码要求思路清晰，所以多写注释和多调试语录对代码的理解非常有帮助，我发现这几次敲代码后每一次代码有很多共同之处，建立链表，插入链表，输出链表的代码基本相同，所以一定要把他们给理解并且记熟，不同之处就是对数据的处理，这次是多项式的加法。首先给两个链表添加元素，然后两个链表的exponent值对比，通过比较大小排列，将相同的值的coefficient值相加，还有就是这个代码的指数固定的是升序排列的，在coefficient值相加时，如果为0，p直接指向p->next，如果不为0，将p给r，p再执行下一个，一直循环，直到其中一个为空，再将不为空的连接在最后。