c++多项式的计算（单项链表的应用）设计处理n次一元多项式P(x) = a0 + a1x + a2x2 + … + anxn,

#include <iostream>
using namespace std;
class Polynomial
{
double *coefs; //系数数组
int *exps; //指数数组
int size; //项数

public:

Polynomial() {coefs=NULL,exps=NULL,size=0;cout<<"构造完成"<<endl;}
Polynomial(double coef[],int exp[],int );
Polynomial(const Polynomial &p);
~Polynomial(){delete []coefs,delete []exps;coefs=NULL;exps=NULL;cout<<"吸构调用"<<endl;}

Polynomial& operator=(const Polynomial &);
int degree() const; //最高幂指数
double evaluate (double x) const; //计算多项式的值
bool operator==(const Polynomial &) const;
bool operator!=(const Polynomial &) const;
Polynomial operator+(const Polynomial &) const;
Polynomial operator-(const Polynomial &) const;
Polynomial operator*(const Polynomial &) const;
Polynomial& operator+=(