该代码整体运行下来没有问题,但有一些小地方没有很好的优化,仅供参考。
#include
#include
typedef struct PolyNode *Polynimial;
struct PolyNode
{
int coef;
int expon;
Polynimial link;
};
void Attach(int c,int e,Polynimial *pRear);//多项式结点的创建
Polynimial ReadPoly();//创建多项式
void PrintPolyn(Polynimial P);//升幂输出多项式
Polynimial Add(Polynimial P1,Polynimial P2);//多项式相加
Polynimial Decrease(Polynimial P1,Polynimial P2);//多项式相减
int Compare(int a,int b);//比较多项式系数大小
Polynimial Mult(Polynimial P1,Polynimial P2);//多项式相乘
Polynimial ReverseList(Polynimial P);//多项式的转置
void mune();//菜单选项
Polynimial ReadPoly()
{
Polynimial P,Rear,t;
int c,e,N;
printf("请输入多项式的项数\n");
scanf("%d",&N);
P=(Polynimial)malloc(sizeof(struct PolyNode));
P->link=NULL;
Rear=P;
printf("请输入多项式(以系数c 指数e的格式输入)\n");
while(N--)
{
scanf("%d%d",&c,&e);
Attach(c,e,&Rear);
}
t=P;
P=P->link;
free(t);
return P;
}
void Attach(int c,int e,Polynimial *pRear)
{
Polynimial P;
P=(Polynimial)malloc(sizeof(struct PolyNode));
P->coef=c;
P->expon=e;
P->link=NULL;
(*pRear)->link=P;
*pRear=P;
}
void PrintPolyn(Polynimial P)
{
printf("%dx^%d",P->coef,P->expon);
P =P->link;
while(P!=NULL)
{
if(P->coef>= 0)
printf("+%dx^%d",P->coef,P->expon);
else
printf("%dx^%d",P->coef,P->expon);
P =P->link;
}
printf("\n\n\n");
}
int Compare(int a,int b)
{
if(a>b) return 1;
else if(a<b) return -1;
else return 0;
}
Polynimial Add(Polynimial P1,Polynimial P2)
{
Polynimial P,Rear,t,t1,t2;
t1=P1;t2=P2;
P=(Polynimial)malloc(sizeof(struct PolyNode));
P->link=NULL;
Rear=P;
while(t1&&t2)
{
switch(Compare(t1->expon,t2->expon))
{
case 1:
Attach(t1->coef,t1->expon,&Rear);
t1=t1->link;
break;
case -1:
Attach(t2->coef,t2->expon,&Rear);
t2=t2->link;
break;
case 0:
if(t1->coef+t2->coef)
Attach(t1->coef+t2->coef,t1->expon,&Rear);
t1=t1->link;
t2=t2->link;
break;
}
}
for(; t1; t1 = t1->link) Attach(t1->coef, t1->expon, &Rear);
for(; t2; t2 = t2->link) Attach(t2->coef, t2->expon, &Rear);
Rear->link=NULL;
t=P;
P=P->link;
free(t);
return P;
}
Polynimial Decrease(Polynimial P1,Polynimial P2)
{
Polynimial P,Rear,t,t1,t2;
t1=P1;t2=P2;
P=(Polynimial)malloc(sizeof(struct PolyNode));
P->link=NULL;
Rear=P;
while(t1&&t2)
{
switch(Compare(t1->expon,t2->expon))
{
case 1:
Attach(t1->coef,t1->expon,&Rear);
t1=t1->link;
break;
case -1:
Attach(t2->coef,t2->expon,&Rear);
t2=t2->link;
break;
case 0:
if(t1->coef+t2->coef)
Attach(t1->coef-t2->coef,t1->expon,&Rear);
t1=t1->link;
t2=t2->link;
break;
}
}
for(; t1; t1 = t1->link) Attach(t1->coef, t1->expon, &Rear);
for(; t2; t2 = t2->link) Attach(t2->coef, t2->expon, &Rear);
Rear->link=NULL;
t=P;
P=P->link;
free(t);
return P;
}
Polynimial Mult(Polynimial P1,Polynimial P2)
{
Polynimial P,Rear,t1,t2,t;
int c,e;
if(!P1||!P2) return NULL;
t1=P1,t2=P2;
P=(Polynimial)malloc(sizeof(struct PolyNode));
P->link=NULL;
Rear=P;
while(t2)
{
Attach(t1->coef*t2->coef,t1->expon+t2->expon,&Rear);
t2=t2->link;
}
t1=t1->link;
while(t1)
{
t2=P2;Rear=P;
while(t2)
{
e=t1->expon+t2->expon;
c=t1->coef*t2->coef;
while(Rear->link&&Rear->link->expon>e)
Rear=Rear->link;
if(Rear->link&&Rear->link->expon==e)
{
if(Rear->link->coef+c)
Rear->link->coef+=c;
else {
t=Rear->link;
Rear->link=t->link;
free(t);
}
}
else
{
t=(Polynimial)malloc(sizeof(struct PolyNode));
t->coef=c;
t->expon=e;
t->link=Rear->link;
Rear->link=t;
Rear=Rear->link;
}
t2=t2->link;
}
t1=t1->link;
}
t2=P;
P=P->link;
free(t2);
return P;
}
Polynimial ReverseList(Polynimial P)
{
Polynimial Ta=NULL;
Polynimial Tb=P;
while(Tb!=NULL)
{
Polynimial Pt=Tb;
Tb=Tb->link;
Pt->link=Ta;
Ta=Pt;
}
return Ta;
}
void mune()
{
printf(" \n");
printf(" \n");
printf(" \n");
printf(" ***************** 欢迎使用多项式计算器 *************** \n ");
printf(" \n");
printf(" 请选择操作:\n");
printf(" 1:创建多项式:\n");
printf(" \n");
printf(" 2:多项式相加:\n");
printf(" \n");
printf(" 3:多项式相减:\n");
printf(" \n");
printf(" 4:多项式相乘:\n");
}
int main()
{
mune();
Polynimial Pa,Pb,Pc,Pd;
int choice,t;
printf("请输入操作指令:");
scanf("%d",&t);
switch(t)
{
case 1:
Pa=ReadPoly();
Pb=ReadPoly();
break;
}
printf("请输入操作指令:");
scanf("%d",&choice);
switch(choice)
{
case 2:
printf("输出结果:\n");
Pc=Add(Pa,Pb);
printf("正序:");
PrintPolyn(Pc);
printf("反序:");
Pd=ReverseList(Pc);
PrintPolyn(Pd);
break;
case 3:
printf("输出结果:\n");
Pc=Decrease(Pa,Pb);
printf("正序:");
PrintPolyn(Pc);
printf("反序:");
Pd=ReverseList(Pc);
PrintPolyn(Pd);
break;
case 4:
printf("输出结果:\n");
Pc=Mult(Pa,Pb);
printf("正序:");
PrintPolyn(Pc);
printf("反序:");
Pd=ReverseList(Pc);
PrintPolyn(Pd);
break;
}
return 0;
}