【正文】 值為0的時候，認為輸入結束{ s =(linkpolyn)malloc(sizeof(polyn))。printf(”請輸入第%d項系數(shù)和指數(shù):“,num)。scanf(”%f%d“,amp。scoef,amp。sexpn)。if((fabs(scoef)expn == 0))//if @{ free(s)。break。} //else @ else //else @{ if(sexpn expn)//if { while(pprior!= NULL amp。amp。 pexpn sexpn)p = pprior。//p向前遍歷鏈表，找到插入點if(sexpn == pexpn){pcoef += scoef。free(s)。r=r。}else{INSERTPOLYN(p,s)。//在p后面插入結點sm = mprior。p = m。}} // if else //else {while(pnext!= NULL amp。amp。 pnextexpn sexpn)p = pnext。//p向后遍歷鏈表，找到插入點if(sexpn == pexpn){pcoef += scoef。free(s)。}else{INSERTPOLYN(p,s)。if(sexpn rexpn){ r = rnext。rnext = NULL。}}} //else } //else @ } //while return head。} //CREATEPOLYNvoid PRINTPOLYN(linkpolyn head){ //以類數(shù)學表達式的形式打印 linkpolyn p。p = headnext。if(p == NULL)//鏈表為空puts(”0“)。else //else @ { //鏈表不為空，輸出第一個結點的值if(pexpn == 0)printf(”%f“,pcoef)。//指數(shù)為0時不輸出x else{ if(pcoef==1)printf(”x^%d“,pexpn)。/**************************/ else if(pcoef ==1)printf(”x^%d“,pexpn)。/**第一項前不需要輸出符號**/ else printf(”%gx^%d“,pcoef,pexpn)。/**************************/} p = pnext。while(p!= NULL){ //依次輸出以后各節(jié)點 if(pcoef0){ //當系數(shù)為正時，討論輸出符號問題if(pexpn == 0)printf(”+%g“,pcoef)。else if(pcoef == 1)printf(”+x^%d“,pexpn)。else printf(”+%gx^%d“,pcoef,pexpn)。} else{ //當系數(shù)為負時，討論輸出符號問題if(pexpn == 0)printf(”%g“,pcoef)。else if(pcoef ==1)printf(”x^%d“,pexpn)。else printf(”%gx^%d“,pcoef,pexpn)。} p = pnext。} } //else @ } //PRINTPOLYNlinkpolyn ADDPOLYN(linkpolyn A , linkpolyn B){ //加法linkpolyn qa,qb,q,ptr。float x。qa = Anext。qb = Bnext。q = INITPOLYN()。//和多項式頭結點初始化ptr = q。//ptr指向和多項式頭結點while((qa!= NULL)amp。amp。(qb!= NULL)){ //升冪求和if(qaexpn == qbexpn)//指數(shù)相同的項{ x = qacoef + qbcoef。//系數(shù)相加if(x!= 0)//求得系數(shù)非0{ qnext =(linkpolyn)malloc(sizeof(polyn))。//q = qnext。qcoef = x。qexpn = qaexpn。}生成和多項式的節(jié)結點qa = qanext。qb = qbnext。}else //指數(shù)不同{qnext =(linkpolyn)malloc(sizeof(polyn))。q = qnext。if(qaexpn qbexpn)//A多項式當前指數(shù)大于B{ qcoef = qbcoef。//B多項式當前的值復制到和多項式中qexpn = qbexpn。qb = qbnext。}else //B多項式當前指數(shù)大于A{ qcoef = qacoef。//A多項式當前的值復制到和多項式中qexpn = qaexpn。qa = qanext。}} } //A或B中有一個多項式已經(jīng)處理完畢while(qa!= NULL)//A未處理完畢，將其余各項復制到和多項式中{ qnext =(linkpolyn)malloc(sizeof(polyn))。q = qnext。qcoef = qacoef。qexpn = qaexpn。qa = qanext。} while(qb!= NULL)//B未處理完畢，將其余各項復制到和多項式中{ qnext =(linkpolyn)malloc(sizeof(polyn))。q = qnext。qcoef = qbcoef。qexpn = qbexpn。qb = qbnext。} qnext = NULL。//令和多項式最末的節(jié)點指向頭結點return ptr。//返回多項式頭指針 } //LINKPOLYNlinkpolyn SUBTRACTPOLYN(linkpolyn A , linkpolyn B){ //減法linkpolyn qa,qb,q,ptr。float x。qa = Anext。qb = Bnext。q = INITPOLYN()。//和多項式頭結點初始化ptr = q。//ptr指向和多項式頭結點while((qa!= NULL)amp。amp。(qb!= NULL)){ //升冪求差if(qaexpn == qbexpn)//指數(shù)相同的項{ x = qacoefqbcoef。//多項式A的系數(shù)減去B的系數(shù)if(x!= 0)//求得系數(shù)非0{ qnext =(linkpolyn)malloc(sizeof(polyn))。//生成和多項式的節(jié)結點q = qnext。qcoef = x。qexpn = qaexpn。}qa = qanext。qb = qbnext。}else //指數(shù)不同{qnext =(linkpolyn)malloc(sizeof(polyn))。q=qnext。if(qaexpn qbexpn)//A多項式當前指數(shù)大于B{ qcoef =(qbcoef)。//B多項式當前的值復制到和多項式中qexpn = qbexpn。qb = qbnext。}else //B多項式當前指數(shù)大于A{ qcoef = qacoef。//A多項式當前的值復制到和多項式中qexpn = qaexpn。qa = qanext。}} } //A或B中有一個多項式已經(jīng)處理完畢while(qa!= NULL)//A未處理完畢，將其余各項復制到和多項式中{ qnext =(linkpolyn)malloc(sizeof(polyn))。q = qnext。qcoef = qacoef。qexpn = qaexpn。qa = qanext。} while(qb!= NULL)//B未處理完畢，將其余各項復制到和多項式中{ qnext =(linkpolyn)malloc(sizeof(polyn))。q = qnext。qcoef =(qbcoef)。qexpn = qbexpn。qb = qbnext。} qnext = NULL。//令和多項式最末的節(jié)點指向頭結點return ptr。//返回多項式頭指針 } //SUBTRACTPOLYNlinkpolyn MULTIPLYPOLYN(linkpolyn A,linkpolyn B){ //乘法linkpolyn pa,pb,s,head,m,r,p。pa = Anext。pb = Bnext。head = INITPOLYN()。r = head。s=(linkpolyn)malloc(sizeof(polyn))。scoef = pacoef * pbcoef。//計算第一個結點，并且第一個結點自然有序sexpn = paexpn + pbexpn。rnext = s。sprior = r。r =rnext。rnext = NULL。p=r。//p為插入點前一結點m=r。//m指向排完結點中間節(jié)點pb=pbnext。// 第一個乘積處理完畢f(xié)or(pa= Anext。pa!= NULL。pa=panext)//for pa 處理其余乘積{ //用A的第一個結點分別與B的其余結點相乘if(pa == Anext)pb = Bnextnext。elsepb = Bnext。for(。pb!= NULL。pb = pbnext)//for pb{s =(linkpolyn)malloc(sizeof(polyn))。scoef = pacoef * pbcoef。sexpn = paexpn + pbexpn。if(sexpn expn)//if { while(pprior!=NULL amp。amp。 pexpn sexpn)p=pprior。//p向前遍歷鏈表，找到插入點if(sexpn==pexpn){pcoef+=scoef。free(s)。}else{INSERTPOLYN(p,s)。//在p后面插入結點sm=mprior。p=m。}} // if else //else { while(pnext!=NULL amp。amp。 pnextexpn sexpn)p=pnext。//p向前遍歷鏈表，找到插入點if(sexpn==pexpn){pcoef+=scoef。free(s)。}else{INSERTPOLYN(p,s)。if(sexpn rexpn){ r=rnext。rnext=NULL。}}} //else } //for pb } //for pa return head。} //MULTIPLYPOLYNlinkpolyn DERIVATIONPOLYN(linkpolyn L){ //多項式求導linkpolyn head,p,s,r。head = INITPOLYN()。//head為求導多項式頭結點 r = head。p = Lnext。while(p!= NULL){ if(pexpn == 0){ p = pnext。continue。} s =(linkpolyn)malloc(sizeof(polyn))。scoef = pcoef * pexpn。sexpn = pexpn1。sprior = r。rnext = s。r = rnext。rnext = NULL。p = pnext。} return(head)。} //DERIVATIONPOLYNfloat WORK(float x,int e){ //求x的冪 float t = 1。if(e0){ while(e){ t *= x。e。} } if(e{ t *= 1/x。e++。} }return(t)。} //WORKfloat CALCULATEPOLYN(linkpolyn head,float x){ //計算多項式在x處的值 float t = 0。linkpolyn p。p = headnext。while(p){ t = t +((pcoef)*(WORK(x,pexpn)))。p = pnext。} return(t)。} //CALCULATEPOLYNint main(void){ linkpolyn A, B,addp,decp,mulp,derp1,derp2。int i。float x。start: system(”cls“)。printf(”一元稀疏多項式計算nn“)。printf(”“)。printf(”“)。printf(”“)。printf(”“)。printf(”“)。printf(”“)。printf(”“)。printf(”“)。printf(”請輸入選項(1~7):“)。scanf(”%d“,amp。i)。switch(i){ case(1): system(”cls“)。printf(”建立多項式nn“)。printf(”建立多項式A,當輸入0 0 時表示出入完畢n“)。A = CREATEPOLYN()。printf(”建立多項式成功n“)。printf(”建立多項式B,當輸入0 0 時表示出入完畢n“)。B = CREATEPOLYN()。printf(”建立多項式成功n“)。printf