PAGEPAGE2數(shù)據(jù)結(jié)構(gòu)與算法課程設(shè)計(jì)說(shuō)明書

設(shè)計(jì)題目：一元多項(xiàng)式的加法.減法的實(shí)現(xiàn)需求分析功能：首先建立一個(gè)有序鏈表，輸入一個(gè)多項(xiàng)式，進(jìn)行降冪排列。接著判斷進(jìn)行加減乘哪種運(yùn)算，再輸入一個(gè)多項(xiàng)式進(jìn)行運(yùn)算.2概要設(shè)計(jì)a．建立多項(xiàng)式鏈表輸入m項(xiàng)的系數(shù)和指數(shù)，建立表示一元多項(xiàng)式的有序鏈表P。依次輸入m個(gè)非零項(xiàng)，生成結(jié)點(diǎn)并插入鏈表。再在界面上輸入n個(gè)非零項(xiàng)的系數(shù)和指數(shù)structterm*CreatPolyn(structterm*P,intm){//輸入m項(xiàng)的系數(shù)和指數(shù)，建立表示一元多項(xiàng)式的有序鏈表Pinti; structterm*h=P=(structterm*)malloc(sizeof(structterm)),*q;if(m<=0)returnNULL;P->coef=0.0;printf("依次輸入%d個(gè)非零項(xiàng)\n",m);for(i=1;i<=m;++i){//依次輸入m個(gè)非零項(xiàng)scanf("%f%d",&P->coef,&P->expn);if(P->coef)q=P;P=P->next=(structterm*)malloc(sizeof(structterm));}q->next=NULL;free(P);returnh;}//CreatPolynb．多項(xiàng)式加法利用兩個(gè)多項(xiàng)式的結(jié)點(diǎn)構(gòu)成“和多項(xiàng)式”，Pa=Pa+Pb.structterm*APolyn(structterm*Pa,structterm*Pb){//多項(xiàng)式加法：Pa=Pa＋Pb，利用兩個(gè)多項(xiàng)式的結(jié)點(diǎn)構(gòu)成"和多項(xiàng)式"。structterm*h,*qa=Pa,*qb=Pb,*p,*q;floatsum;h=p=(structterm*)malloc(sizeof(structterm));p->next=NULL;while(qa&&qb){//Pa和Pb均非空switch(Compare(qa,qb)){case-1://多項(xiàng)式PA中當(dāng)前結(jié)點(diǎn)的指數(shù)值小p->next=qb;p=qb;qb=qb->next;break;case0://兩者的指數(shù)值相等sum=qa->coef+qb->coef;if(sum!=0.0){//修改多項(xiàng)式PA中當(dāng)前結(jié)點(diǎn)的系數(shù)值p->next=qa;qa->coef=sum;p=qa;qa=qa->next;}else{//刪除多項(xiàng)式PA中當(dāng)前結(jié)點(diǎn)q=qa;qa=qa->next;free(q);}q=qb;qb=qb->next;free(q);break;case1://多項(xiàng)式PB中當(dāng)前結(jié)點(diǎn)的指數(shù)值小p->next=qa;p=qa;qa=qa->next;break;}//switch}//whileif(Pa)p->next=qa;//鏈接Pa中剩余結(jié)點(diǎn)if(Pb)p->next=qb;//鏈接Pb中剩余結(jié)點(diǎn)q=h;h=h->next;free(q);returnh;}//APolync．多項(xiàng)式減法Pa=Pa-Pb，利用兩個(gè)多項(xiàng)式的結(jié)點(diǎn)構(gòu)成"差多項(xiàng)式"。structterm*BPolyn(structterm*Pa,structterm*Pb){//多項(xiàng)式減法：Pa=Pa-Pb，利用兩個(gè)多項(xiàng)式的結(jié)點(diǎn)構(gòu)成"差多項(xiàng)式"。structterm*p=Pb;while(p){p->coef*=-1;p=p->next;}returnAPolyn(Pa,Pb);}//BPolynd．多項(xiàng)式乘法多項(xiàng)式乘法：Pa=Pa*Pb，利用兩個(gè)多項(xiàng)式的結(jié)點(diǎn)構(gòu)成"積多項(xiàng)式"。tructterm*CPolyn(structterm*Pa,structterm*Pb){//多項(xiàng)式乘法：Pa=Pa*Pb，利用兩個(gè)多項(xiàng)式的結(jié)點(diǎn)構(gòu)成"積多項(xiàng)式"。structterm*pa=Pa,*p,*q,*r,*s,*t;r=p=(structterm*)malloc(sizeof(structterm));if(!Pb)returnNULL;while(pa){p->coef=pa->coef;p->expn=pa->expn;q=p;p=p->next=(structterm*)malloc(sizeof(structterm));pa=pa->next;}q->next=NULL;free(p);pa=Pa;t=s=(structterm*)malloc(sizeof(structterm));while(pa){q=s;s=s->next=(structterm*)malloc(sizeof(structterm));pa=pa->next;}q->next=NULL;free(s);pa=Pa;while(pa){pa->coef*=Pb->coef;pa->expn+=Pb->expn;pa=pa->next;}Pb=Pb->next;while(Pb){p=r;s=t;while(p){s->coef=p->coef*Pb->coef;s->expn=p->expn+Pb->expn;p=p->next;s=s->next;}Pa=APolyn(Pa,t);Pb=Pb->next;}returnPa;}//CPolyne．主函數(shù)建立主函數(shù)界面，實(shí)現(xiàn)加、減、乘主要功能。界面運(yùn)算由輸入第一個(gè)一元多項(xiàng)式開(kāi)始，逐步實(shí)現(xiàn)多項(xiàng)式計(jì)算。voidmain(){structterm*M,*N;chars[2];inti,n;puts("一元多項(xiàng)式計(jì)算:\n輸入一一元多項(xiàng)式的項(xiàng)數(shù)");scanf("%d",&n);M=CreatPolyn(M,n);M=selsort(M);PrintfPoly(M);p:puts("\n1:加\n2:減\n3:乘\n4:退出");getchar();q:gets(s);if(s[1]!='\0'||!isdigit(*s)){puts("輸入有誤,請(qǐng)重新輸入!");gotoq;}i=*s-48;switch(i){case1:M=A(M,N);gotop;;case2:M=B(M,N);gotop;;case3:M=C(M,N);gotop;case4:break;default:puts("輸入有誤,請(qǐng)重新輸入!");gotoq;}}3詳細(xì)設(shè)計(jì)#include<stdlib.h>#include<stdio.h>#include<ctype.h>typedefstructterm{//項(xiàng)的表示，多項(xiàng)式的項(xiàng)作為L(zhǎng)inkList的數(shù)據(jù)元素floatcoef;//系數(shù)intexpn;//指數(shù)structterm*next;}term;structterm*CreatPolyn(structterm*P,intm){//輸入m項(xiàng)的系數(shù)和指數(shù)，建立表示一元多項(xiàng)式的有序鏈表Pinti;structterm*h=P=(structterm*)malloc(sizeof(structterm)),*q;if(m<=0)returnNULL;P->coef=0.0;printf("依次輸入%d個(gè)非零項(xiàng)\n",m);for(i=1;i<=m;++i){//依次輸入m個(gè)非零項(xiàng)scanf("%f%d",&P->coef,&P->expn);if(P->coef)q=P;P=P->next=(structterm*)malloc(sizeof(structterm));}q->next=NULL;free(P);returnh;}//CreatPolynstructterm*selsort(structterm*h){structterm*g,*p,*q;floatf;inti,fini=1;if(!h)returnNULL;for(g=h;g->next&&fini;g=g->next){fini=0;for(p=h,q=h->next;q;p=p->next,q=q->next)if(p->expn<q->expn){f=p->coef;i=p->expn;p->coef=q->coef;p->expn=q->expn;q->coef=f;q->expn=i;fini=1;}}for(g=h,p=g->next;p;)if(g->expn==p->expn){g->coef+=p->coef;g->next=p->next;q=p;p=p->next;free(q);}elseif(g->next){g=g->next;p=p->next;}returnh;}PrintfPoly(structterm*P){structterm*q=P;if(!q){putchar('0');return;}if(q->coef!=1){printf("%g",q->coef);if(q->expn==1)putchar('X');elseif(q->expn)printf("X^%d",q->expn);}elseif(!q->expn)putchar('1');elseif(q->expn==1)putchar('X');elseprintf("X^%d",q->expn);q=q->next;while(q){if(q->coef>0)putchar('+');if(q->coef!=1){printf("%g",q->coef);if(q->expn==1)putchar('X');elseif(q->expn)printf("X^%d",q->expn);}elseif(!q->expn)putchar('1');elseif(q->expn==1)putchar('X');elseprintf("X^%d",q->expn);q=q->next;}}Compare(structterm*a,structterm*b){if(a->expn<b->expn)return-1;if(a->expn>b->expn)return1;return0;}structterm*APolyn(structterm*Pa,structterm*Pb){//多項(xiàng)式加法：Pa=Pa＋Pb，利用兩個(gè)多項(xiàng)式的結(jié)點(diǎn)構(gòu)成"和多項(xiàng)式"。structterm*h,*qa=Pa,*qb=Pb,*p,*q;floatsum;h=p=(structterm*)malloc(sizeof(structterm));p->next=NULL;while(qa&&qb){//Pa和Pb均非空switch(Compare(qa,qb)){case-1://多項(xiàng)式PA中當(dāng)前結(jié)點(diǎn)的指數(shù)值小p->next=qb;p=qb;qb=qb->next;break;case0://兩者的指數(shù)值相等sum=qa->coef+qb->coef;if(sum!=0.0){//修改多項(xiàng)式PA中當(dāng)前結(jié)點(diǎn)的系數(shù)值p->next=qa;qa->coef=sum;p=qa;qa=qa->next;}else{//刪除多項(xiàng)式PA中當(dāng)前結(jié)點(diǎn)q=qa;qa=qa->next;free(q);}q=qb;qb=qb->next;free(q);break;case1://多項(xiàng)式PB中當(dāng)前結(jié)點(diǎn)的指數(shù)值小p->next=qa;p=qa;qa=qa->next;break;}//switch}//whileif(Pa)p->next=qa;//鏈接Pa中剩余結(jié)點(diǎn)if(Pb)p->next=qb;//鏈接Pb中剩余結(jié)點(diǎn)q=h;h=h->next;free(q);returnh;}//APolynstructterm*A(structterm*Pa,structterm*Pb){intn;puts("再輸入一一元多項(xiàng)式的項(xiàng)數(shù)");scanf("%d",&n);Pb=CreatPolyn(Pb,n);Pb=selsort(Pb);PrintfPoly(Pa);if(Pb&&Pb->coef>0)printf("+");PrintfPoly(Pb);Pa=APolyn(Pa,Pb);printf("=");Pa=selsort(Pa);PrintfPoly(Pa);returnPa;}structterm*BPolyn(structterm*Pa,structterm*Pb){//多項(xiàng)式減法：Pa=Pa-Pb，利用兩個(gè)多項(xiàng)式的結(jié)點(diǎn)構(gòu)成"差多項(xiàng)式"。structterm*p=Pb;while(p){p->coef*=-1;p=p->next;}returnAPolyn(Pa,Pb);}//BPolynstructterm*B(structterm*Pa,structterm*Pb){intn;puts("再輸入一一元多項(xiàng)式的項(xiàng)數(shù)");scanf("%d",&n);Pb=CreatPolyn(Pb,n);Pb=selsort(Pb);PrintfPoly(Pa);printf("-");putchar('(');PrintfPoly(Pb);putchar(')');Pa=BPolyn(Pa,Pb);printf("=");Pa=selsort(Pa);PrintfPoly(Pa);returnPa;}structterm*CPolyn(structterm*Pa,structterm*Pb){//多項(xiàng)式乘法：Pa=Pa*Pb，利用兩個(gè)多項(xiàng)式的結(jié)點(diǎn)構(gòu)成"積多項(xiàng)式"。structterm*pa=Pa,*p,*q,*r,*s,*t;r=p=(structterm*)malloc(sizeof(structterm));if(!Pb)returnNULL;while(pa){p->coef=pa->coef;p->expn=pa->expn;q=p;p=p->next=(structterm*)malloc(sizeof(structterm));pa=pa->next;}q->next=NULL;free(p);pa=Pa;t=s=(structterm*)malloc(sizeof(structterm));while(pa){q=s;s=s->next=(structterm*)malloc(sizeof(structterm));pa=pa->next;}q->next=NULL;free(s);pa=Pa;while(pa){pa->coef*=Pb->coef;pa->expn+=Pb->expn;pa=pa->next;}Pb=Pb->next;while(Pb){p=r;s=t;while(p){s->coef=p->coef*Pb->coef;s->expn=p->expn+Pb->expn;p=p->next;s=s->next;}Pa=APolyn(Pa,t);Pb=Pb->next;}returnPa;}//CPolynstructterm*C(structterm*Pa,structterm*Pb){intn;puts("再輸入一一元多項(xiàng)式的項(xiàng)數(shù)");s