1、 double Value(double x);/-返回多项式在x下的值 void Clear();/-清空多项式 Polynomial shunxu();/-指数递增变递减,递减变递增 Polynomial paixu();/-用来对计算后结果的排序处理 (主要去掉系数为0的项) /* 函数方法 */ void Input();/-多项式输入 void OutPut();/-多项式输出 Polynomial Add(Polynomial &b);/-多项式相加 Polynomial Subtract(Polynomial &/-多项式相减 Polynomial Multiply(Polyno
2、mial &/-多项式相乘 Polynomial Divide(Polynomial & /-多项式相除 /* 操作符重载 friend istream& operator(istream &is,Polynomial &obj);/-输入符号重载 friend ostream& operator(ostream &os,Polynomial &/-输出符号重载 Polynomial operator+(Polynomial &/-加号重载 Polynomial operator-(Polynomial &/-减号重载 Polynomial operator*(Polynomial &/-乘号
3、重载 Polynomial operator/(Polynomial &/-除号重载 int Polynomial:Degree() listiterator iter=termList.begin(); term temp=(term)*iter; int degree=temp.exp; return degree;double Polynomial:Value(double x) double sum=0; int i; for(;iter!=termList.end();iter+) term temp=(term)*iter; int t=1; for(i=temp.exp;i!=0
4、;i-) t=t*x; sum+=temp.coef*t; return sum;void Polynomial:Clear() termList.clear();Polynomial Polynomial:shunxu() Polynomial p1; term temp; term t_a=(term)*iter; temp.coef=t_a.coef; temp.exp=t_a.exp; p1.termList.push_front(temp); return p1;/用来对计算后结果的排序处理 (在输入时已经对系数为0的情况处理过了,但得出的结果系数可能有等于0的,此方法就是对系数为0
5、的情况处理) paixu() Polynomial aaa;iterator it =termList.begin();it!) term t11=*it; if(t11.coef=0) it+; else aaa.termList.push_back(t11); return aaa;Input() int n; coutn;按升幂输入多项式的系数和指数endl; for(int i=1;i=n;i+) term t_temp; coutt_temp.coef;t_temp.exp; if(t_temp.coef!=0) termList.push_back(t_temp); OutPut(
6、) if(termList.empty()0 elseiterator it = termList.begin(); if(t11.exp! if(t11.coef=1) if(t11.exp=1) cout0) cout+ else else coutxt11.exp; if(+it! else if(t11.coef=(-1) if(t11.exp=1)-x if(+it! else cout-x if(+it! t11.coef cout else else cout else Add(Polynomial &b) Polynomial c;iterator iter_a=termLis
7、t.begin();iterator iter_b=b.termList.begin(); while(iter_a!=termList.end()&iter_b!=b.termList.end() term t_a=(term)*iter_a; term t_b=(term)*iter_b; if(t_a.exp c.termList.push_back(t_a); iter_a+; t_temp.coef=t_a.coef+t_b.coef; t_temp.exp=t_a.exp; c.termList.push_back(t_temp);iter_a!iter_a+) c.termLis
8、t.push_back(*iter_a);=b.termList.end();iter_b+) c.termList.push_back(*iter_b); Polynomial c1=c.paixu(); return c1;Subtract(Polynomial & if(t_a.exp else if(t_a.exp temp.coef=-t_b.coef; temp.exp=t_b.exp; c.termList.push_back(temp); temp.coef=t_a.coef-t_b.coef; temp.exp=t_a.exp; term temp2; term t_b=(t
9、erm)*iter_b; temp2.coef=-t_b.coef; temp2.exp=t_b.exp; c.termList.push_back(temp2);Multiply(Polynomial &Polynomial c; Polynomial c1;/这个 c1的位置只能放在这里,局部变量 for(; term temp; term t_a=(term)*iter_a; temp.coef=t_a.coef*t_b.coef; temp.exp=t_a.exp+t_b.exp; c1.termList.push_back(temp); c=c.Add(c1); c1.Clear()
10、; return c; Divide(Polynomial & Polynomial a;/被除数 a.termList.push_back(temp); /- Polynomial quotient,remainder,temp1,temp2;iterator qa_a=a.termList.begin();iterator qb_b=b.termList.begin(); term qa=(term)*qa_a; term qb=(term)*qb_b; temp1=a; /cout=qb.exp) term temp2_term; temp2_term.coef=qa.coef/qb.c
11、oef; temp2_term.exp=qa.exp-qb.exp; quotient.termList.push_back(temp2_term); Polynomial center_quotient; center_quotient.termList.push_back(temp2_term); Polynomial tt=b*center_quotient; a=a-tt; a=a.paixu();iterator qa_1=a.termList.begin(); qa=(term)*qa_1; Polynomial ji=quotient*b; / Polynomial remainder =temp1-ji; return remainder;istream &operatorobj)请输入多项式的项数: obj.termList.push_back(t_temp); return is;ostream& if(obj.termList.empty()iterator it = obj.termList.begin();=obj.termList.end();=obj.termList.end() term t112=*it; if(t112.coef cout else t11