一元多项式相加程序及习题2.docVIP

一元多项式表示及相加程序如下: //Add Polynomial Pa and Pb #includestdlib.h #includemalloc.h #includeconio.h #includestdio.h Stuct Term { float coef; int expn; struct Term *next; }LinkList; LinkList *CreateList_L(int n) { int i; LinkList *p,*L; L=(LinkList *)malloc(sizeof(LinkList)); L-next=NULL; for(i=n;i0;--i) { p=(LinkList *)malloc(sizeof(LinkList)); printf(“input coef=”); scanf(“%d”,p-coef);printf(“\n”); printf(“input expn=”); scanf(“%d”,p-expn);printf(“\n”); p-next=L-next; L-next=p; }//end of for Return L; }//end of function CreateList Char cmp(int qa_expn,int qb-expn) { if(qa_expn==qb_expn) return’=‘; else if(qa_expnqb_expn)return’’; else return’‘; }//end of cmp() function LinkList *Addpolyn(LinkList *pa, LinkList *pb) { LinkList *qa,*qb,*pre,*u; float sum; qa=pa-next; qb=pb-next; pre=pa; while(qaqb) switch(cmp(qa-expn,qb-expn)) {case ‘‘: pre=qa;qa=qa-next; break; case’=‘: sum=qa-coef+qb-coef; if(sum!=0.0) {qa-coef=sum;pre=qa;} else {pre-next=qa-next;free(qa);} qa=pre-next;u=qb;qb=qb-next; free(u); break; case’’: u=qb-next; qb-next=qa; pre-next=qb; pre=qb; qb=u; break; }//end of switch if(!qa)pre-next=qb; free(qb); return pa; }end of Addpolyn() function main() {LinkList *pa,*pb,*pc,*p; int NodeNum_pa,NodeNum_pb; Printf(“input NodeNum_pa:”); Scanf(“%d”, NodeNum_pa); printf(“Please input the pa.coef and pa.expn”); pa=CreateList_L(NodeNum_pa); Printf(“input NodeNum_pb:”); Scanf(“%d”, NodeNum_pb); printf(“Please input the pb.coef and pb.expn”); pb= CreateList_L( NodeNum_pb); Pc=Addpolyn(pa,pb); P=pc; printf(“result:\n”); while(p-nex