多项式分析和总结.docx

多项式#includeiostream using namespace std; struct node {int exp; double coef; node *next;}; class poly {private: node *head; public: poly(); void in1_poly(); void in2_poly(int,int[],double[]); void del_poly(); void prt_poly(); poly operator +(poly ); poly operator *(poly ); }; poly::poly() {node *p; p=new node; p-exp=-1; p-next=p; head=p; return;} void poly::in1_poly() {node *p,*k; int e; double c; k=head; cout输入:系数空格指数。输入指数-1 结束!endl; cince; while (e=0) {p=new node; p-exp=e;p-coef=c; p-next=head; k-next=p; k=p; cince;} return;} void poly::in2_poly(int n,int e[],double c[]) {int k; node *p; for