北邮数据结构实验一题目3一元多项式(代码)

{
element * p=front->next;
cout<<"F"<<c<<"(X) = ";
if (p==NULL)
{
cout<<0;
}
while(p)
{
if (p->exp==0)
{
cout<<p->coef;
}
else
{
p_prior=p;
m=p->exp;
p=p->next;
}
element * temp=q;
q=q->next;
delete temp;
}
}
if (q)
{
p_prior->next=q;
while (q->next)
e3[j].exp=i;
j++;
}
}
C=new Polylist(e3,n);//构造二项式对象
//释放动态空间
delete []coe1;
delete []coe2;
delete []coe3;
return C;
}
//输入二项式的函数(非类里面的函数)
}
if (p->exp==0) //常数项求导
{
front->next=p->next;
element *temp=p;
p=p->next;
delete temp;
}
while (p)
{
p->coef*=p->exp;
p->exp-=1;
if(p->next==NULL)
{
sum+=p->coef*pow(x,p->exp);
p=p->next;
}
cout<<sum<<endl;
}
//求导
void Polylist::Pi()
{
element *p =front->next;
if (p==NULL)//空链表的处理
{
return;
{
C=new Polylist;
return C;
}
for (int i=0;i<=m+P.m;i++)
{
coe1[i]=0;
coe2[i]=0;
}
for (int i=0;i<=m+P.m;i++)
{
if (p!=NULL&&i==p->exp)//有这一指数项则在i的位置存储此项系数
cout<<endl;
break;
case 4:
P1.Pi();P1.PrintList("1'");
{
coe1[i]=p->coef;
p=p->next;
}
if (q!=NULL&&i==q->exp)
{
coe2[i]=q->coef;
q=q->next;
}
if (p==NULL&&q==NULL)//一旦p和q同时为空就跳出循环,p所指的一项后面的项系数在前面已经设为0
int m;//记录最大项指数
};
//构造函数
Polylist::Polylist(element e[],int n)
{
if (e==NULL)
{
front=new element;
front ->next=NULL;
m=0;
return;
}
front = new element;
element* cinPolylist(int &n,char* c)
{
cout<<"请输入二项式"<<c<<"的信息(按升幂输入):"<<endl;
cout<<"项数:";cin>>n;
element *e=NULL;
if (n==0)
{
return e;
}
e=new element[n];//在主函数中释放
{
m=p->exp;
}
p=p->next;
}
}
//二项式乘法
Polylist* Polylist::Multiply(Polylist &P)
{
element * p=front->next;
element * q=P.front->next;
//以下申请3个动态数组来分别存储F1(X)的系数列,F2(X)系数列以及相乘后的系数列;
{
//下面首先输入两个二项式
int m;
element *e1=cinPolylist(m,"1");
Polylist P1(e1,m);
P1.PrintList("1");
delete e1;e1=NULL;//释放并置空(在P1.PrintList("1")里面申请的)
cout<<p->coef<<"X^"<<p->exp;
}
p=p->next;
if ((p!=0)&&(p->coef>0))
{
cout<<"+";
}
}
cout<<" max:"<<m<<endl<<endl;
}
//二项式加减法
void Polylist::Add(Polylist *P,char c)
{
p->coef+=q->coef;
if (fabs(p->coef)<1e-7)//合并系数为零
{
p_prior->next=p->next;
delete p;
p=p_prior->next;
m--;
}
else
{
{
element*p_prior=front;
element*p=front->next;
element*q=P->front->next;
if(c=='-')//实现减法
{
while (q)
{
q->coef=0-q->coef;
q=q->next;
}
if (coe3[i]!=0)//不为0的就自增一项
{
n++;
}
}
element *e3=new element[n];
for (int i=0,j=0;i<=m+P.m;i++)//构造每一项
{
if (coe3[i]!=0)
{
e3[j].coef=coe3[i];
{
q=q->next;
}
m=q->exp;
}
P->front=NULL;
}
//计算在x处的值
void Polylist::Calculate(double x)
{
element *p =front->next;
double sum=0;
while (p)
front ->next=NULL;
for(int i=n-1;i>=0;i--)
{
element * s=new element(e[i].coef,e[i].exp);
s->next=front->next;
front->next=s;
}
m=e[n-1].exp;
for (int i=0;i<n;i++)
{
cout<<"第"<<i+1<<"项指数:";cin>>e[i].exp;
while (i!=0&&e[i].exp<=e[i-1].exp)
{
cout<<"请输入大于前一项的指数:";cin>>e[i].exp;
}
p=p->next;
m=q->exp;
}
else if (p->exp>q->exp)
{
p_prior->next=q;
p_prior=q;
q=q->next;
p_prior->next=p;
m=p->exp;
}
else
P1.Add(&P2,'-');
P1.PrintList("3");
break;