c语言实现两多项式相乘并排序合并同类项.docVIP

#includestdio.h typedef struct Node { int coef;//系数 int exp;//指数 struct Node *next; }PolyNode; PolyNode *Creatpoly()//创建多项式的单链表 { PolyNode *h,*p,*q; h=(PolyNode *)malloc(sizeof(PolyNode)); p=h; p-next=NULL; printf(请输入多项式的系数及其指数a，b，当系数输入0时停止输入\n); q=(PolyNode *)malloc(sizeof(PolyNode)); scanf(%d,%d,q-coef,q-exp); while(q-coef!=0) { p-next=q; p=q; q=(PolyNode *)malloc(sizeof(PolyNode)); scanf(%d,%d,q-coef,q-exp); } p-next=NULL; return(h); } void Prin_poly(PolyNode *h)//将多项式输出函数 { PolyNode *p; p=h-next; while(p!=NULL) { if(p-coef0p!=h-next) { if(p-exp0) printf(+%dx^%d,p-coef,p-exp); else if(p-exp0) printf(+%dx^(%d),p-coef,p-exp); else printf(+%d,p-coef); } else if(p-coef0p!=h-next) { if(p-exp0) printf(%dx^%d,p-coef,p-exp); else if(p-exp0) printf(%dx^(%d),p-coef,p-exp); else printf(%d,p-coef); } else { if(p-exp0) printf(%dx^%d,p-coef,p-exp); else if(p-exp0) printf(%dx^(%d),p-coef,p-exp); else printf(%d,p-coef); } p=p-next; } } void Insort(PolyNode *h)//排序函数，使多项式中的各项按X的升幂排列 { PolyNode *s,*p; int t,m; for(p=h-next;p!=NULL;p=p-next)//类似于冒泡排序 { for(s=h-next;s-next!=NULL;s=s-next) { if(s-exps-next-exp) { t=s-exp; m=s-coef; s-coef=s-next-coef; s-exp=s-next-exp; s-next-coef=m; s-next-exp=t; } } } } void UnitePoly(PolyNode *h)//合并同类项 { PolyNode *p1,*p2,*q1,*q2,*temp; q1=h; p1=q1-next; while(p1!=NULL) { p2=p1-next; q2=p1; while(p2!=NULL) { if(p1-exp==p2-exp) { p1-coef=p1-coef+p2-coef; if(p1-coef==0) { temp=p2; q2-next=p2-next; free(temp); temp=p1; q1-next=p1-next; p1=q1; free(temp); break; } else { temp=p2; q2-next=p2-next; p2=p2-next; free(temp); } } else { q2=p2; p2=p2-next; } } q1=p1; p1=p1-next; } } PolyNode *polymuti(PolyNode *h1,PolyNode *h2)//多项式相乘 { PolyNode *h,*p,*p1,*p2,*q; p1=h1-