多项式加法-数据结构.docVIP

#includeiostream #include stdlib.h using namespace std; struct polynomail { double coef; int exp; polynomail *next; }*p,*q,*r,*s,*Pa,*Pb,*head; double t; int u; polynomail *CreatPolyn(polynomail *head,int m)//---------输入 { double x; int y; cout请输入第1项的系数和指数:endl; while(1) { cinxy; if(!cin) { cout 输入有错!请重新输入 endl; cin.clear(); cin.sync(); } else { break; } } p=new polynomail; head=p; p-coef=x; p-exp=y; p-next=NULL; for(int i=2;i=m;i++) { cout请输入第i项的系数和指数:endl; while(1) { cinxy; if(!cin) { cout 输入有错!请重新输入 endl; cin.clear(); cin.sync(); } else { break; } } q=new polynomail; p-next=q; q-coef=x; q-exp=y; q-next=NULL; p=q; } return head; }//--------------------------------------------------------输入 void PrintPolyn(polynomail *P)//---------------------------输出 { p=P; while(p) { if(p==P) { if(p-exp==0) coutp-coef; else if(p-coef!=1p-exp!=1) coutp-coefx^p-exp; else if(p-coef==1p-exp!=1) coutx^p-exp; else if(p-coef!=1p-exp==1) coutp-coefx; else coutx; } else { if(p-coef0p-coef!=1p-exp!=1) cout+p-coefx^p-exp; else if(p-coef0p-coef!=1p-exp==1) cout+p-coefx; else if(p-coef0p-coef!=-1p-exp!=1) coutp-coefx^p-exp; else if(p-coef0p-coef!=-1p-exp==1) coutp-coefx; else if(p-coef0p-coef==1p-exp!=1) cout+x^p-exp; else if(p-coef0p-coef==1p-exp==1) cout+x; else if(p-coef0p-coef==-1p-exp!=1) cout-x^p-exp; else if(p-coef0p-coef==-1p-exp==1) cout-x; } p=p-next; } coutendl; }//--------------------------------------------------------输出 void CombPolyn(polynomail *P)//----------------------------梳理 { for(p=P;p;p=p-next) { for(q=p-next,r=p;q;) { if(q-expp-exp) { u=q-exp; q-exp=p-exp; p-exp=u; t=q-coef; q-coef=p-coef; p-coef=t; q=q-next; r=r-next; } else if(q-exp==p-exp) {