多項式的加減乘除c++

1、#include<iostream>#include<cmath>using namespace std;/多項式節(jié)點的定義 struct Termfloat coef; / 系數(shù) int exp; / 指數(shù) Term * link;Term(float c,int e,Term *next=NULL)coef=c;exp=e;link=next;Term* InsertAfter(float c,int e);friend ostream& operator<<(ostream&,const Term&); /多項式類的定義 cla

2、ss Polynomialpublic:Polynomial(); /構(gòu)造函數(shù) Polynomial(Polynomial& R); /復(fù)制構(gòu)造函數(shù) int maxOrder(); / 計算最大階數(shù)，并返回 Term * getHead() const return first; /取得多項式單鏈表的表頭指針 private:Term *first;friend ostream& operator<<(ostream&,const Polynomial&); /重載運算符<< friend istream& operator>

3、;>(istream&,const Polynomial&); /重載運算符>> friend Polynomial operator + (Polynomial&,Polynomial&); /重載運算符+ friend Polynomial operator * (Polynomial&,Polynomial&); /重載運算符* ;/在當(dāng)前由this指針指示的項后面插入一個新項 Term* Term:InsertAfter(float c,int e)link=new Term(c,e,link); /創(chuàng)建一個新節(jié)點，自動

4、鏈接 return link; / 插入到this后面 / Term的友元函數(shù)，輸出一個節(jié)點x的內(nèi)容到輸出流out中 ostream& operator<<(ostream& out,const Term& x)if(x.coef=0) /系數(shù)為零，不輸出 return out;out<<x.coef; /輸出系數(shù) switch(x.exp) /輸出指數(shù) case 0: break;case 1: out<<"X"break;default:out<<"X"<<x.exp

5、;break;return out;/Polynomial類的構(gòu)造函數(shù)，建立一個空鏈表 Polynomial:Polynomial()first=new Term(0,-1);/復(fù)制構(gòu)造函數(shù)，用已有的對象初始化當(dāng)前對象 Polynomial:Polynomial(Polynomial& R)first=new Term(0,-1);Term *destptr=first,*srcptr=R.getHead()->link;while(srcptr!=NULL)destptr->InsertAfter(srcptr->coef,srcptr->exp);srcpt

6、r=srcptr->link;destptr=destptr->link;/計算最大階數(shù)，當(dāng)多項式按升序排列時，最后一項是指數(shù)最大的 int Polynomial:maxOrder()Term* current=first;while(current->link!=NULL)current=current->link;return current->exp;/Polynomial類的友元函數(shù)，從輸入流in輸入各項，用尾插法建立一個多項式 istream& operator>>(istream& in,Polynomial& x)

7、Term* rear=x.getHead(); / rear是尾指針 int c,e;while(1)cout<<"Input a term(coef,exp):"<<endl;in>>c>>e;if(e<0) break; /e<0，退出循環(huán)，輸入結(jié)束 rear=rear->InsertAfter(c,e);return in;/Polynomial類的友元函數(shù)：輸出帶 附加頭結(jié)點的多項式鏈表x ostream& operator<<(ostream& out,Polynomia

8、l& x)Term* current=x.getHead()->link;cout<<"The polynomal is:"<<endl;bool h=true;while(current!=NULL)if(h=false&&current->coef>0)out<<"+"h=false;out<<*current; /調(diào)用Term類的重載運算符<< current=current->link;out<<endl;return out;

9、/Polynomial類的友元函數(shù)：兩個帶附加頭結(jié)點的按升冪排列的多項式鏈表的頭指針分別是A.first和B.first/返回的是A+B所得的結(jié)果多項式鏈表 Polynomial operator + (Polynomial &A,Polynomial &B) Term *pa,*pb,*pc,*p;float temp;Polynomial C;pc=C.first;pa=A.getHead()->link;pb=B.getHead()->link;while(pa!=NULL&&pb!=NULL)if( pa->exp = pb->e

10、xp ) /對應(yīng)系數(shù)相等，系數(shù)相加 temp=pa->coef+pb->coef;if(fabs(temp)>0.001)pc=pc->InsertAfter(temp,pa->exp); /系數(shù)相加后不為零，將結(jié)果保存 pa=pa->link;pb=pb->link;else if(pa->exp<pb->exp)pc=pc->InsertAfter(pa->coef,pa->exp);pa=pa->link;elsepc=pc->InsertAfter(pb->coef,pb->exp);

11、pb=pb->link;if(pa!=NULL)p=pa;elsep=pb;while(p!=NULL) /處理鏈?zhǔn)Ｓ嗖糠?pc=pc->InsertAfter(p->coef,p->exp);p=p->link;return C;/Polynomial類的友元函數(shù)：將一元多項式A和B相乘，乘積用帶附加頭結(jié)點的單鏈表存儲/返回值為指向存儲乘積多項式的單鏈表的頭指針 Polynomial operator * (Polynomial &A,Polynomial &B)Term *pa,*pb,*pc;int AL,BL,i,k,maxExp;Poly

12、nomial C; /結(jié)果多項式 pc=C.getHead();AL=A.maxOrder();BL=B.maxOrder();if(AL!=-1|BL!=-1)maxExp=AL+BL;float *result=new floatmaxExp+1;for(i=0;i<=maxExp;i+)resulti=0;pa=A.getHead()->link;while(pa!=NULL)pb=B.getHead()->link;while(pb!=NULL)k=pa->exp+pb->exp;resultk=resultk+pa->coef*pb->coef;pb=pb->link;pa=pa->link;for(i=0;i<=maxExp;i+)if(fabs(resulti)>0.001)pc=pc->InsertAfter(resulti,i);delete result;pc->link=NULL;return C;int main()Polynomial A,B,C;cout<<"請輸入多項式A:（ 系數(shù) 冪數(shù)（冪數(shù)小于0結(jié)束）"<<endl;cin>>A;cout<<"請輸入