多项式的加减乘除c++

{
Polynomial A,B,C;
cout<<"请输入多项式A:（系数幂数（幂数小于0结束））"<<endl;
cin>>A;
cout<<"请输入多项式B:（系数幂数（幂数小于0结束））"<<endl;
cin>>B;
C=A+B;
cout<<"A+B为："<<C<<endl;
C=A*B;
cout<<"A*B为："<<C<<endl;
pb=pb->link;
}
pa=pa->link;
}
for(i=0;i<=maxExp;i++)
if(fabs(result[i])>0.001)
pc=pc->InsertAfter(result[i],i);
delete []result;
}
pc->link=NULL;
return C;
}
int main()
#include<iostream>
#include<cmath>
using namespace std;
//多项式节点的定义
struct Term{
float coef; //系数
int exp; //指数
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&);
};
//多项式类的定义
class Polynomial{
public:
Polynomial(); //构造函数
Polynomial(Polynomial& R); //复制构造函数
int maxOrder(); //计算最大阶数，并返回
Term * getHead() const { return first;} //取得多项式单链表的表头指针
private:
Term *first;
friend ostream& operator<<(ostream&,const Polynomial&); //重载运算符<<
for(i=0;i<=maxExp;i++)
result[i]=0;
pa=A.getHead()->link;
while(pa!=NULL)
{
pb=B.getHead()->link;
while(pb!=NULL)
{
k=pa->exp+pb->exp;
result[k]=result[k]+pa->coef*pb->coef;
{
first=new Term(0,-1);
Term *destptr=first,*srcptr=R.getHead()->link;
while(srcptr!=NULL){
destptr->InsertAfter(srcptr->coef,srcptr->exp);
srcptr=srcptr->link;
destptr=destptr->link;
}
}
//计算最大阶数，当多项式按升序排列时，最后一项是指数最大的
int Polynomial::maxOrder()
{
Term* current=first;
while(current->link!=NULL)
current=current->link;
return current->exp;
default:
out<<"X"<<x.exp;
break;
}
return out;
}
//Polynomial类的构造函数，建立一个空链表
Polynomial::Polynomial()
{
first=new Term(0,-1);
}
//复制构造函数，用已有的对象初始化当前对象
Polynomial::Polynomial(Polynomial& R)
ostream& operator<<(ostream& out,const Term& x)
{
if(x.coef==0) //系数为零，不输出
return out;
out<<x.coef; //输出系数
switch(x.exp){ //输出指数
case 0: break;
case 1: out<<"X";break;
};
//在当前由this指针指示的项后面插入一个新项
Term* Term::InsertAfter(float c,int e)
{
link=new Term(c,e,link); //创建一个新节点，自动链接
return link; //插入到this后面
}
// Term的友元函数，输出一个节点x的内容到输出流out中
}
//Polynomial类的友元函数，从输入流in输入各项，用尾插法建立一个多项式
istream& operator>>(istream& in,Polynomial& x)
{
Term* rear=x.getHead(); // rear是尾指针
int c,e;
while(1)
{
cout<<"Input a term(coef,exp):"<<endl;
pa=pa->link;
}
else
{
pc=pc->InsertAfter(pb->coef,pb->exp);
pb=pb->link;
}
}
if(pa!=NULL)
p=pa;
else
p=pb;
while(p!=NULL) //处理链剩余部分
{
pc=pc->InsertAfter(p->coef,p->exp);
system("pause");
return 0;
}
current=current->link;
}
out<<endl;
return out;
}
//Polynomial类的友元函数：两个带附加头结点的按升幂排列的多项式链表的头指针分别是A.first和B.first
//返回的是A+B所得的结果多项式链表
Polynomial operator + (Polynomial &A,Polynomial &B)
int AL,BL,i,k,maxExp;
Polynomial C; //结果多项式
pc=C.getHead();
AL=A.maxOrder();
BL=B.maxOrder();
if(AL!=-1||BL!=-1)
{
maxExp=AL+BL;
float *result=new float[maxExp+1];
friend istream& operator>>(istream&,const Polynomial&); //重载运算符>>
friend Polynomial operator + (Polynomial&,Polynomial&); //重载运算符+
friend Polynomial operator * (Polynomial&,Polynomial&); //重载运算符*
p=p->link;
}
return C;
}
//Polynomial类的友元函数：将一元多项式A和B相乘，乘积用带附加头结点的单链表存储
//返回值为指向存储乘积多项式的单链表的头指针
Polynomial operator * (Polynomial &A,Polynomial &B)
{
Term *pa,*pb,*pc;
{
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->exp ) //对应系数相等，系数相加
{
temp=pa->coef+pb->coef;
if(fabs(temp)>0.001)
pc=pc->InsertAfter(temp,pa->exp); //系数相加后不为零，将结果保存
pa=pa->link;
pb=pb->link;