#include<stdio.h>#include<malloc.h>/**
* Linked list of integers. The key is data. The key is sorted in non-descending order.
*/typedefstructLinkNode{int coefficient;int exponent;structLinkNode*next;}*LinkList,*NodePtr;/**
* Initialize the list with a header.
* @return The pointer to the header.
*/
LinkList initLinkList(){
LinkList tempHeader =(LinkList)malloc(sizeof(structLinkNode));
tempHeader->coefficient =0;
tempHeader->exponent =0;
tempHeader->next =NULL;return tempHeader;}// Of initLinkList/**
* Print the list.
* @param paraHeader The header of the list.
*/voidprintList(LinkList paraHeader){
NodePtr p = paraHeader->next;while(p !=NULL){printf("%d * 10^%d + ", p->coefficient, p->exponent);
p = p->next;}// Of whileprintf("\r\n");}// Of printList/**
* Print one node for testing.
* @param paraPtr The pointer to the node.
* @param paraChar The name of the node.
*/voidprintNode(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.
*/voidappendElement(LinkList paraHeader,int paraCoefficient,int paraExponent){
NodePtr p, q;// Step 1. Construct a new node.
q =(NodePtr)malloc(sizeof(structLinkNode));
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.
*/voidadd(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');}elseif((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 ifprintf("p = %ld, q = %ld \r\n", p, q);}// Of whileprintf("End of while.\r\n");if(p ==NULL){
r->next = q;}else{
r->next = p;}// Of ifprintf("Addition ends.\r\n");}// Of add/**
* Unit test 1.
*/voidadditionTest1(){// 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");}// Of additionTest1/**
* Unit test 2.
*/voidadditionTest2(){// 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.
*/intmain(){additionTest1();additionTest2();printf("Finish.\r\n");return0;}// Of main
我的代码
#include<stdio.h>#include<stdlib.h>typedefstructLinkNode{int coefficient;int exponent;structLinkNode*next;}*LinkList,*NodePtr;//创建链表
LinkList initLinkList(){
LinkList tempHeader =(LinkList)malloc(sizeof(structLinkNode));
tempHeader->coefficient =0;
tempHeader->exponent =0;
tempHeader->next =NULL;return tempHeader;}//输出链表voidprintList(LinkList paraHeader){
NodePtr p = paraHeader->next;while(p !=NULL){printf("%d * 10^%d + ", p->coefficient, p->exponent);
p = p->next;}printf("\n");}//添加元素voidappendElement(LinkList paraHeader,int paraCoefficient,int paraExponent){
NodePtr p, q;
q =(NodePtr)malloc(sizeof(structLinkNode));
q->coefficient = paraCoefficient;
q->exponent = paraExponent;
q->next =NULL;
p = paraHeader;while(p->next !=NULL){
p = p->next;}
p->next = q;}//多项式加法voidadd(NodePtr paraList1, NodePtr paraList2){
NodePtr p, q, r, s;
p = paraList1->next;
q = paraList2->next;
r = paraList1;free(paraList2);while((p !=NULL)&&(q !=NULL)){if(p->exponent < q->exponent){
r->next = p;
r = p;
p = p->next;}elseif(p->exponent > q->exponent){
r->next = q;
r = q;
q = q->next;}else{
p->coefficient = p->coefficient + q->coefficient;printf("The coefficient is: %d\n", p->coefficient);if(p->coefficient ==0){
s = p;
p = p->next;free(s);}else{
r->next = p;
r = p;
p = p->next;}
s = q;
q = q->next;free(s);}printf("End of while\n");}if(p ==NULL){
r->next = q;}elseif(q ==NULL){
r->next = p;}printf("Addition ends.\n");}//测试代码1voidadditionTest1(){// 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");}//测试代码2voidadditionTest2(){// 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");}intmain(){additionTest1();additionTest2();printf("Finish.\r\n");return0;}
数据结构 C 代码 多项式的加法老师代码#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;} *L