多项式相加链表实现(可添加多个多项式).doc

#include stdafx.h#include iostream#include windows.husing namespace std;struct Polynomialfloat coef;int expn;Polynomial *next;void build(Polynomial *head)Polynomial *p=head,*q;while(p-next)p=p-next;char c1;char c2;cout输入非数字结束！n;while(1)q=new Polynomial();coutc1;if(c19)break;int re=1;/判断指数是否相同Polynomial *w=head-next;while(1)w=head-next;re=0;while(w)if(c1=(w-expn+0)re=1;w=w-next;if(re=1)coutc1;else break;coutc2;if(c29)break;q-expn=c1-0;q-coef=c2-0;q-next=NULL;p-next=q;p=p-next;coutnext;while(p)if(p-next)coutcoefX(expn)+;else coutcoefX(expnnext;coutnext,*q1;Polynomial *p2=head2-next,*q2;Polynomial *addhead,*add;addhead=new Polynomial();addhead-next=NULL;Polynomial *addp=addhead;while(p1)int re=1;Polynomial *add=new Polynomial();p2=head2-next;while(p2)if(p1-expn=p2-expn)add-coef=p1-coef+p2-coef;add-expn=p1-expn;add-next=NULL;addp-next=add;addp=addp-next;re=0;p2=p2-next;if(re=1)add-coef=p1-coef;add-expn=p1-expn;add-next=NULL;addp-next=add;addp=addp-next;p1=p1-next;p2=head2-next;Polynomial *ap=addp-next;while(p2)int re=1;Polynomial *add=new Polynomial();ap=addhead-next;while(ap)if(p2-expn=ap-expn)re=0;ap=ap-next;if(re=1)add-coef=p2-coef;add-expn=p2-expn;add-next=NULL;addp-next=add;addp=addp-next;p2=p2-next;show(addhead);int main(int argc, char* argv)Polynomial *head10;int k;int n=0;while(1)cout 多项式相加endl;cout1-建立多项式 2-显示 3-相加 0-退出:endl;coutk;if(k=1)system(cls);/cout 建立多项式next=NULL;build(headn);n+;system(cls);/if(k=2)system(cls);cout显示多项式n;for(int i=0;in;i+)show(headi);getchar();getchar();system(cls);if(k=3)system(cls);/?for(int i=0;in;i+)couti+1 : ;show(headi);cout请输入要加的多项式的序号a,b:ab;if(a0&a0&bn+1)add(heada-1,headb-1);else cout输入错误！;getchar();getchar();system(cls);if(k=0)int m0=5