一元多項(xiàng)式相加實(shí)驗(yàn)報(bào)告

一元多項(xiàng)式相加實(shí)驗(yàn)報(bào)告一元多項(xiàng)式的相加一實(shí)驗(yàn)內(nèi)容根據(jù)所學(xué)的數(shù)據(jù)結(jié)構(gòu)中線性結(jié)構(gòu)（線性表）的邏輯特性和物理特性及相關(guān)法，應(yīng)用于求解一個(gè)具體的實(shí)際問題 兩個(gè)多項(xiàng)式相加二需求分析掌握線性結(jié)構(gòu)的邏輯特性和物理特性。建立一元多項(xiàng)式。將一元多項(xiàng)式輸入，并存儲(chǔ)在內(nèi)存中，并按照指數(shù)降序排列輸出多項(xiàng)式。能夠完成兩個(gè)多項(xiàng)式的加減運(yùn)算，并輸出結(jié)果。三概要設(shè)計(jì)本程序所用到的抽象數(shù)據(jù)類型：typedefOrderedLinkList polynomial;//用帶表頭結(jié)點(diǎn)的有序鏈表表示多項(xiàng)式結(jié)點(diǎn)的數(shù)據(jù)元素類型定義為:typedefstruct{//項(xiàng)的表示floatcoef;//系數(shù)int expn;//指數(shù)term,ElemType;VoidAddPolyn(polynomail&Pa,polynomail&Pb)PositionGetHead()PositionNextPos(LinkListL,Linkp)ElemGetCurElem(Linkp)intcmp(terma termb)StatusSetCurElem(Link&p,ElemTypee)StatusDelFirst(Linkh,Link&q)StatusListEmpty(LinkListL)StatusAppend(LinkList&L,LinkFreeNode()存儲(chǔ)結(jié)構(gòu)coefcoefexpnext項(xiàng)式的相加相減操作。模塊劃分a)主程序；2）初始化單鏈表；3）建立單鏈表；4）相加多項(xiàng)式a)主程序；2）初始化單鏈表；3）建立單鏈表；4）相加多項(xiàng)式主程序流程圖開始開始申請(qǐng)結(jié)點(diǎn)空間輸入多項(xiàng)式各項(xiàng)的系數(shù)X，指數(shù)Y輸出已輸出的多項(xiàng)式否是否輸入正確合并同類項(xiàng)結(jié)束四詳細(xì)設(shè)計(jì)根據(jù)一元多項(xiàng)式相加的運(yùn)算規(guī)則：對(duì)于兩個(gè)一元多項(xiàng)式中所有指數(shù)相同的項(xiàng)，對(duì)應(yīng)系數(shù)相加，若其和不為零，則構(gòu)成“和多項(xiàng)式”中的一項(xiàng)，對(duì)PolyAddpapb所指的兩個(gè)多項(xiàng)式相加，結(jié)果為paqaqb分別從多項(xiàng)式的首項(xiàng)開始掃描2-5-1qa和qb可能出現(xiàn)下列三種情況之一：qa->expqb->exp,qa繼續(xù)向后掃描。qa->expqb->exp,則將其系數(shù)相加。若相加結(jié)果不為零，將結(jié)果qa->coefqbqaqbqa、qb繼續(xù)向后掃描。qa->expqb->exp,qbqa所指結(jié)點(diǎn)之前，然后qa、qb繼續(xù)向后掃描。qaqbpa指向的鏈表即為兩個(gè)多項(xiàng)式之和。五源程序代碼#include<stdio.h>#include<malloc.h>#include<stdlib.h>#defineNULL0typedefstructNODE{float coef; //系數(shù)int expn; //指數(shù)structNODE*next;}NODE;NODE*Creat(intn);voidprint(NODENODE*AddPolyn(NODE*head1,NODE*head2);NODE*Delfirst(NODE*head,NODE*q);voidInsertBefore(NODE*p1,NODEint compare(inta,intb);main(){NODE*head1,*head2,*head3;intn1,n2;printf("請(qǐng)輸入你需要的多項(xiàng)數(shù)的數(shù)目n1 :");scanf("%d",&n1);head1=Creat(n1);printf("第一個(gè)多項(xiàng)式的顯示:\n");print(head1);printf("\n請(qǐng)輸入你需要的多項(xiàng)數(shù)的數(shù)目n2 :scanf("%d",&n2);head2=Creat(n2);printf("\n第二個(gè)多項(xiàng)式的顯示:print(head2);head3=AddPolyn(head1,head2);printf("\n合并后的多項(xiàng)式的顯示:print(head3);printf("\n");}/*創(chuàng)建鏈表*/NODE*Creat(intn){NODE*current,*previous,*head;inti;head=(NODE*)malloc(sizeof(NODE));/*創(chuàng)建頭結(jié)點(diǎn)*/previous=head;for(i=0;i<n;i++){current=(NODE*)malloc(sizeof(NODE));printf("請(qǐng)輸入系數(shù)和指數(shù):");scanf("%f%d",¤t->coef,¤t->expn);previous->next=current;previous=current;}previous->next=NULL;returnhead;}/*qaqbpb(00),pb里面由InsertBefore和Delfirst兩個(gè)小模塊組成一部分NODE *AddPolyn(NODE*head1,NODE*head2){NODE*ha,*hb,*qa,*qb;inta,b;floatsum;ha=head1; /*hahb指向頭結(jié)點(diǎn)hb=head2;qa=ha->next; /*qaqb指向頭結(jié)點(diǎn)的下一個(gè)結(jié)點(diǎn)qb=hb->next;while(qa&&qb) /*qaqb均非空*/{a=qa->expn;b=qb->expn;switch(compare(a,b)){case-1: /*qa->expn<qb->expn*/ha=qa;qa=qa->next;break;case0:sum=qa->coef+qb->coef; /*系數(shù)的和*/if(sum!=0.0){ /*如果不是qa->coef=sum; /*改變系數(shù)*/ha=qa;}else{free(Delfirst(ha,qa));}free(Delfirst(hb,qb));qa=ha->next;qb=hb->next; /*qb釋放后要重新賦值*/break;case1: /*qa->expn>qb->Delfirst(hb,qb);InsertBefore(ha,qb); /*qbha下一個(gè)結(jié)點(diǎn)之前qb=hb->next;ha=ha->next;break;}}if(qb)ha->next=qb; /*free(head2);returnhead1;}/*比較*/intcompare(inta,intb){if(a<b)return-1;elseif(a>return1;elsereturn0;}/*刪除結(jié)點(diǎn)q*/NODE*Delfirst(NODE*p1,NODE*q){p1->next=q->next;return(q);}/*插入結(jié)點(diǎn),引入結(jié)點(diǎn)p,可以讓p插入到p2和p1之間*/voidInsertBefore(NODE*p1,NODE*p2){NODE*p;p=p1->next;p1->next=p2;p2->next=p;}/*打印,為了美觀程序分開打印*/voidprint(NODE*head){NODE*current;current=head->next;while(current->next!=NULL){printf("%0.f*x^%d+",current->coef,current->expn);current=current->next;}printf("%0.f*x^%d",current->coef,current->expn);}六調(diào)試分析