多项式数据结构c语言实现

}
PLTerm * PolyMult(PLTerm * a,PLTerm * b)
{
/*多项式乘法*/
PLTerm * p;
PolyZero(&p);
while(a->next !=NULL)
{
p=PolyAdd(p,PolySMult(b,a->next->coef,a->next->expon));
p->coef =c;
p->expon =e;
p->next =NULL;
(* rear)->next=p;
(* rear)=p;
return 1;
}
int PolyRead(PLTerm * head)
{
PLTerm ** rear= &head;
int i , n;
int e;
float c;
printf("请输入待操作多项式的项数：\n");
{
PolyAttach(&rear,(a->next->coef)*c,(a->next->expon)+e);
a=a->next;
}
rear->next =NULL;
return p;
}
PLTerm * PolySub(PLTerm * a,PLTerm * b)
{
/*多项式减法*/
return PolyAdd(a,PolySMult(b,-1,0));
{
sum=a->next->coef + b->next->coef;
if(sum) PolyAttach(&rear,sum,a->next->expon);
a= a->next;
b= b->next;
}
else
{
PolyAttach(&rear,b->next->coef,b->next->expon);
}
*head=NULL;
}
else
printf("%.2f,%d",p->coef,p->expon);
printf("\n");
}
PLTerm * PolyAdd(PLTerm * a,PLTerm * b)
{
/*多项式加法*/
PLTerm * p ,* rear;
float sum;
PolyZero(&p);
rear= p;
b= b->next;
}
}
}
for(;a->next !=NULL;a= a->next) PolyAttach(&rear,a->next->coef,a->next->expon);
for(;b->next !=NULL;b= b->next) PolyAttach(&rear,b->next->coef,b->next->expon);
typedef struct PTerm
{
float coef;
int expon;
struct PTerm * next;
} PLTerm;
void PolyZero(PLTerm ** head)
{
if((* head=(PLTerm *)malloc(sizeof(PLTerm)))==NULL)
scanf("%d",&n);
printf("\n");
for(i=1;i<=n;i++)
{
printf("请输入多项式第%d项的系数：c ,指数：e\n",i);
scanf("%f,%d",&c,&e);
if(PolyAttach(rear,c,e)==0) return 0;
}
return 1;
term*=x;
term*=a->next->coef;
sum+=term;
a=a->next;
}
return sum;
}
void PolyErase(PLTerm ** head)
{
PLTerm * p, * p1;
p= * head;
while(p!=NULL)
{
p1=p;
p=p->next;
free(p1);
return -1;
}
else
return head->next->expon;
}
int PolyAttach(PLTerm ** rear,float c,int e)
{
PLTerm * p;
if((p=(PLTerm *)malloc(sizeof(PLTerm)))==NULL) return 0;
exit(1);
(* head)->next=NULL;
(* head)->coef=0;
(* head)->expon=0;
}
int PolyNotZero(PLTerm * head)
{
if(head->next==NULL) return 0;
else
return 1;
}
int PolyLength(PLTerm * head)
}
void PolyWrite(PLTerm * head)
{
PLTerm * p=head;
if(PolyNotZero(head))
while(p->next !=NULL)
{
printf("%.2f,%d ",p->next->coef,p->next->expon);
p= p->next;
}
while(a->next !=NULL && b->next !=NULL)
{
if(a->next->expon > b->next->expon)
{
PolyAttach(&rear,a->next->coef,a->next->expon);
a= a->next;
}
else
{
if(a->next->expon == b->next->expon)
a=a->next;
}
return p;
}
float PolyEval(PLTerm * a,float x)
{
/*求多项式a在x处的值*/
float sum=0, term;
int i;
wh(i=0,term=1;i< a->next->expon;i++)
{
PLTerm * p=head;
int size=0;
while(p->next !=NULL)
{
p=p->next;
size++;
}
return size;
}
int PolyLeadExp(PLTerm * head)
{
/*求多项式阶数*/
if(!PolyNotZero(head))
{
printf("error\n");
rear->next =NULL;
return p;
}
PLTerm * PolySMult(PLTerm * a,float c,int e)
{
/*多项式a乘系数为c指数为e的项*/
PLTerm * p, * rear;
PolyZero(&p);
rear=p;
while(a->next !=NULL)