多项式的加法

创建链表

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

创立头节点

LinkList initLinkList(){
  	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;
	 }// Of while
	 printf("\r\n");

添加元素

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;

测试

void additionTest(){
 	//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);
    printList(tempList1);

完整代码

#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 liat 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 tasting.
  * @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 seccond 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 = 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 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.
 */
  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);
    printList(tempList1);
}// Of additionTest
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 additionTest
 
 
/**
 *The entrance.
 */
 int main(){
 	additionTest();
 	printf("Finish.\r\n");
 }// Of main