一元多项式相加问题的实验报告

q=p; cin>>x>>y; if(x==0&&y==0) break; r=a; while(r!=q->next) { if(y<=r->exp) { cout<<\请按照指数递增顺序输入,请重新输入\ cin>>x>>y; break; } r=r->next; } if(x==0&&y==0) break; }

if(q!=NULL) q->next=NULL; return a; }

void out_fun(node *a) { node *p; p=a; while(p) { if(p==a) cout<coef<<\ else if(p->coef<0) cout<coef<<\ else if(p->coef>0) cout<<\ p=p->next; } cout<

node *plus_fun(node *a,node *b) { node *c,*p,*q,*r,*w; float x; p=a; q=b; c=a; r=c; while(p&&q) {

if((p->exp)<(q->exp)) { w=p; p=p->next; r->next=w; r=w; } else if(p->exp==q->exp) { x=p->coef+q->coef; if(x!=0) { p->coef=x; w=p; p=p->next; r->next=w; r=w; w=q; q=q->next; delete w; } else if(x==0) { w=p; p=p->next; delete w; w=q; q=q->next; delete w; } } else if(p->exp>q->exp) { w=q; q=q->next; r->next=w; r=w; } }

if(p!=NULL) { while(p) { w=p; p=p->next; r->next=w;

r=w; } } if(q!=NULL) { while(q) { w=q; q=q->next; r->next=w; r=w; } } r->next=NULL; return c; }

int main() { node *a,*b,*c; int n=1; while(n) { cout<>n; cout<>n; } cout<

}