一元稀疏多项式源代码

1、#include #include typedef struct polynomial float coef; int expn; struct polynomial *next;*polyn,polynomial;void insertpolyn(polyn p,polyn h)/插入p； polyn q1,q2; if(p-coef=0)free(p); else q1=h; q2=q1-next; while(q2&p-expnq2-expn) q1=q1-next; q2=q2-next; if(q2&p-expn=q2-expn) q2-coef+=p-coef; free(p);

2、if(q2-coef=0) q1-next=q2-next; free(q2); else p-next=q2; q1-next=p; void destroypolyn(polyn p)/销毁链表 polyn q1,q2; q1=p-next; if(q1) q2=q1-next; while(q1-next) free(q1); q1=q2; q2=q2-next; free(q1);void printpolyn(polyn p)/打印多项式 polyn q=p-next; int flag=0; if(!q)putchar(0); while(q) if(q-coef!=0) if(q

3、-expn=0) printf(%f ,q-coef);/x0 flag+; else if(flag=0) if(q-expn=1) if(q-coef!=1&q-coef!=-1)printf(%fX ,q-coef); else if(q-coef=1)printf(X); else printf(-X ); else if(q-coef!=1&q-coef!=-1)printf(%fX%d ,q-coef,q-expn); else if(q-coef=1)printf(X%d ,q-expn); else printf(-X%d,q-expn); flag+; else if(q-e

4、xpn=1) if(q-coef0&q-coef!=1)printf(+%fX ,q-coef); else if(q-coef=1)printf(+X ); else if(q-coef=-1)printf(-X ); else printf(%fX ,q-coef); else if(q-coef0&q-coef!=1)printf(+%fX%d ,q-coef,q-expn); else if(q-coef=1)printf(+X%d ,q-expn); else if(q-coef=-1)printf(-X%d ,q-expn); else printf(%fX%d ,q-coef,q

5、-expn); q=q-next; polyn creatpolyn(polyn head,int m)/创建项数为m,头指针为head的单链表 polyn p; int i; head=(polyn)malloc(sizeof(struct polynomial); head-next=NULL; for(i=0;icoef,&p-expn); insertpolyn(p,head); return head; int compare(polyn pa,polyn pb)/比较多项式指数 if(pa&pb) if(pa-expnexpn)return 1;/pa=pa-next; else

6、if(pa-expnpb-expn)return -1;/insert else return 0;/pa-expn=pb-expn else if(!pb)return 1;/pb已读完， else return -1;/pb未读完 polyn addpolyn(polyn pa,polyn pb)/实现多项式的相加 polyn qa=pa-next; polyn qb=pb-next; polyn q=pa; polyn p; while(qa|qb) switch(compare(qa,qb) case 1:q=q-next;qa=qa-next;break; case -1: p=(p

7、olyn)malloc(sizeof(struct polynomial); p-coef=qb-coef; p-expn=qb-expn; p-next=qa; q-next=p; q=p; qb=qb-next; break; case 0: qa-coef=qa-coef+qb-coef; if(qa-coef!=0) qa=qa-next; q=q-next; qb=qb-next; else q-next=qa-next; free(qa); qa=q-next; qb=qb-next; break; return pa;polyn subtract(polyn pa,polyn pb)/实现多项式的相减 polyn qb=pb-next; while(qb!=NULL) qb-coef*=-1; qb=qb-next; addpolyn(pa,pb); return pa;int main() int group,i,m1,m2,flag; polyn pa=0; polyn pb=0; scanf(%d,&group); for(i=0;igroup;i+) scanf(%d%d%d,&m1,&m2,&flag); pa=creatpolyn(pa,m1); pb=creatpolyn(pb,m2); if(flag=0)pa=addp