一元多项式简单计算器.docVIP

一元多项式简单计算器 #includestdio.h #includemalloc.h #includestdlib.h typedef struct Polynomial{ float coef; int expn; struct Polynomial *next; }*Polyn,Polynomial; void Insert(Polyn p,Polyn h){ if(p-coef==0) free(p); else { Polyn q1,q2; q1=h; q2=h-next; while(q2p-expnq2-expn) { q1=q2; q2=q2-next; } if(q2p-expn==q2-expn) { q2-coef+=p-coef; free(p); if(!q2-coef) { q1-next=q2-next; free(q2); } } else { p-next=q2; q1-next=p; } } } Polyn CreatePolyn(Polyn head,int m){ int i; Polyn p; p=head=(Polyn)malloc(sizeof(struct Polynomial)); head-next=NULL; for(i=0;im;i++) { p=(Polyn)malloc(sizeof(struct Polynomial)); printf(qingshuru%dxiangdexishuyuzhishu:,i+1); scanf(%f %d,p-coef,p-expn); Insert(p,head); } return head; } void DestroyPolyn(Polyn p){ Polyn q1,q2; q1=p-next; q2=q1-next; while(q1-next) { free(q1); q1=q2; q2=q2-next; } } void PrintPolyn(Polyn P){ Polyn q=P-next; int flag=1; if(!q) { putchar(0); printf(\n); return; } while(q) { if(q-coef0flag!=1) putchar(+); if(q-coef!=1q-coef!=-1) { printf(%g,q-coef); if(q-expn==1) putchar(X); else if(q-expn) printf(X^%d,q-expn); } else { if(q-coef==1) { if(!q-expn) putchar(1); else if(q-expn==1) putchar(X); else printf(X^%d,q-expn); } if(q-coef==-1) { if(!q-expn) printf(-1); else if(q-expn==1) printf(-X); else printf(-X^%d,q-expn); } } q=q-next; flag++; } printf(\n); } int compare(Polyn a,Polyn b){ if(ab) { if(!b||a-expnb-expn) return 1;