Polynomial类 多项式

Polynomial类  多项式

用到的知识：动态数组，运算符重载

源代码：

头文件：Polynomial.h

class Polynomial{ public: Polynomial();//默认构造函数，多项式的大小是10 Polynomial(int _size);//一个参数的构造函数，表示这个的项数 Polynomial(const Polynomial &poly);//拷贝构造函数 Polynomial(double* _coefficients,int _size);//有参数的构造函数 ~Polynomial();//析构函数 void tellInfor();//输出信息 void setcoefficient(int num,double coefficient);//改变第num的系数为coefficient double getcoefficient(int num);//得到第num的系数 Polynomial& operator=(const Polynomial& poly);//赋值运算符重载 //多项式与常量之间的+，-，*的运算符重载,使用友元函数 friend Polynomial operator+(const Polynomial& poly,double num); friend Polynomial operator+(double num,const Polynomial& poly); friend Polynomial operator-(const Polynomial& poly,double num); friend Polynomial operator-(double num,const Polynomial& poly); friend Polynomial operator*(const Polynomial& poly,double num); friend Polynomial operator*(double num,const Polynomial& poly); //多项式与多项式之间的+，-，*的运算符重载,使用友元函数 friend Polynomial operator+(const Polynomial& p1,const Polynomial& p2); friend Polynomial operator-(const Polynomial& p1,const Polynomial& p2); friend Polynomial operator*(const Polynomial& p1,const Polynomial& p2); private: double *coefficients;//动态数组，表示各个系数 int size;//这个多项式的大小 };

实现文件：Polynomial.cpp

#include"Polynomial.h" #include<iostream.h> Polynomial::Polynomial(){ size = 10; coefficients = new double[size]; } Polynomial::Polynomial(int _size){ size = _size; coefficients = new double[size]; } Polynomial::Polynomial(const Polynomial &poly){ size = poly.size; coefficients = new double[size]; for(int i=0;i<size;i++){ coefficients[i] = poly.coefficients[i]; } } Polynomial::Polynomial(double*_coefficients,int _size){ size = _size; coefficients = new double[size]; for(int i=0;i<size;i++){ coefficients[i] = _coefficients[i]; } } Polynomial::~Polynomial(){ delete []coefficients; } void Polynomial::tellInfor(){ int temp = 0; //求出这个多项式的最后的非零项 for(int t =0;t<size;t++){ if(coefficients[t]!=0){ temp = t; break; } } for(int i=size-1;i>=0;i--){ if(coefficients[i]!=0){ if(coefficients[i]!=1||i==0) cout<<coefficients[i]; for(int j=0;j<i;j++){ if(j==0){ cout<<"x"; } else{ cout<<"*x"; } } if(i>temp){ cout<<" + "; } } } cout<<endl; } //改变第num的系数为coefficient void Polynomial::setcoefficient(int num,double coefficient){ coefficients[num] = coefficient; } //得到第num的系数 double Polynomial::getcoefficient(int num){ return coefficients[num]; } //赋值运算符重载 Polynomial& Polynomial::operator=(const Polynomial& poly2){ size = poly2.size; coefficients = new double[size]; for(int i=0;i<size;i++){ coefficients[i] = poly2.coefficients[i]; } return *this; } //多项式与常量之间的+法 Polynomial operator+(const Polynomial& poly,double num){ /* Polynomial *p = new Polynomial(poly); p->coefficients[0] += num; return *p; */ Polynomial p(poly); p.coefficients[0] += num; return p; } //多项式与常量之间的-法 Polynomial operator-(const Polynomial& poly,double num){ /* Polynomial *p = new Polynomial(poly); p->coefficients[0] -= num; return *p; */ Polynomial p(poly); p.coefficients[0] -= num; return p; } //多项式与常量之间的*法 Polynomial operator*(const Polynomial& poly,double num){ /* Polynomial *p = new Polynomial(poly); for(int i=0;i<p->size;i++){ p->coefficients[i] *= num; } return *p; */ Polynomial p(poly); for(int i=0;i<p.size;i++){ p.coefficients[i] *= num; } return p; } Polynomial operator+(double num,const Polynomial& poly){ /* Polynomial *p = new Polynomial(poly); p->coefficients[0] += num; return *p; */ Polynomial p(poly); p.coefficients[0] += num; return p; } //多项式与常量之间的-法 Polynomial operator-(double num,const Polynomial& poly){ /* Polynomial *p = new Polynomial(poly); p->coefficients[0] -= num; return *p; */ Polynomial p(poly); for(int i=0;i<p.size;i++){ p.coefficients[i] *= -1; } p.coefficients[0] += num; return p; } //多项式与常量之间的*法 Polynomial operator*(double num,const Polynomial& poly){ /* Polynomial *p = new Polynomial(poly); for(int i=0;i<p->size;i++){ p->coefficients[i] *= num; } return *p; */ Polynomial p(poly); for(int i=0;i<p.size;i++){ p.coefficients[i] *= num; } return p; } Polynomial operator+(const Polynomial& p1,const Polynomial& p2){ if(p1.size>=p2.size){ Polynomial p3(p1); for(int i=0;i<p2.size;i++){ p3.coefficients[i] = p1.coefficients[i]+p2.coefficients[i]; } return p3; } else{ Polynomial p3(p2); for(int i=0;i<p1.size;i++){ p3.coefficients[i] = p1.coefficients[i]+p2.coefficients[i]; } return p3; } } Polynomial operator-(const Polynomial& p1,const Polynomial& p2){ if(p1.size>=p2.size){ Polynomial p3(p1); for(int i=0;i<p2.size;i++){ p3.coefficients[i] = p1.coefficients[i]-p2.coefficients[i]; } return p3; } else{ Polynomial p3(p2); for(int i=0;i<p1.size;i++){ p3.coefficients[i] = p1.coefficients[i]-p2.coefficients[i]; } for(;i<p2.size;i++){ p3.coefficients[i] *= -1; } return p3; } } Polynomial operator*(const Polynomial& p1,const Polynomial& p2){ Polynomial p3(p1.size+p2.size-1); for(int m=0;m<p3.size;m++){ p3.coefficients[m] = 0; } for(int i=0;i<p1.size;i++){ for(int j=0;j<p2.size;j++){ p3.coefficients[i+j] += p1.coefficients[i]*p2.coefficients[j]; } } return p3; }