一元多项式表示相加操作

#include<stdio.h>/*一元多项式表示相加操作，王红刚2009/08/04完成*/#include<stdlib.h>/*程序只用作学习交流，如要转载请注明出处·*/#include <malloc.h>typedef struct Polynode { int coef; int exp; struct Polynode * next;}Polynode, *Polylist;Polylist polycreat()//用尾插法建立一元多项式链表{ Polynode *head,*rear,*s; int c,e; head=(Polynode *)malloc(sizeof(Polynode)); rear=head; scanf("%d,%d",&c,&e); while(c!=0) { s=(Polynode *)malloc(sizeof(Polynode)); s->coef=c; s->exp=e; rear->next=s; rear=s; scanf("%d,%d",&c,&e); } rear->next=NULL; return(head);}void polyadd(Polylist polya,Polylist polyb)//两个多项式相加，将结果保存在polya中{ Polynode *p,*q,*tail,*temp; int sum; p=polya->next; q=polyb->next; tail=polya; while(p!=NULL&&q!=NULL) { if(p->exp<q->exp) { tail->next=p; tail=p; p=p->next; } else if(p->exp==q->exp) { sum=p->coef+q->coef; if(sum!=0) { p->coef=sum; tail->next=p; tail=p; p=p->next; temp=q; q=q->next; free(temp); } else { temp=p; p=p->next; free(temp); temp=q; q=q->next; free(temp); } } else { tail->next=q;tail=q;q=q->next; } } if(p!=NULL) tail->next=p; else tail->next=q;}void main(){ Polynode *p; Polylist polya,polyb; printf("请输入数据建立多项式A:(以0,0结束!)/n"); polya=polycreat(); p=polya->next; while(p!=NULL) { printf("系数为%d 指数为%d/n",p->coef,p->exp); p=p->next; } printf("请输入数据建立多项式B:(以0,0结束!)/n"); polyb=polycreat(); p=polyb->next; while(p!=NULL) { printf("系数为%d 指数为%d/n",p->coef,p->exp); p=p->next; } polyadd(polya, polyb); printf("相加后的多项式为:/n"); p=polya->next; while(p!=NULL) { printf("系数为%d 指数为%d/n",p->coef,p->exp); p=p->next; }}