需要调试的程序如下：
#include
#include
#include
#include
#include
typedef struct term//项的表示
{ float coef; //系数
int expn; //指数
struct term *next;
}Term;
int c=0;
Term* CreatPolyn(int m)
// 输入m项的系数和指数，建立表示一元多项式的有序链表P
{ float r;int i,t;
Term *h,*P,*q;
c=0;
if(m<=0) return NULL;
h=P=(Term*)malloc(sizeof(Term));
for(i=1;i<=m;i++) // 依次输入m个非零项
{ printf("请输入第%d个非零项的系数（实型）和指数（整型）（例如：系数，指数）： ",i);
scanf("%f,%d",&r,&t);printf("\n");
if(r)
{ P->coef=r; P->expn=t;
if(i!=m)
{q=(Term*)malloc(sizeof(Term));
P->next=q;
P=q;
}
c++;
}
}
P->next=NULL;
return h;
} // CreatPolyn
Term* selsort(Term *h)//按照幂次的高低将对应项进行排序，并进行合并同类项。
{ Term *g, *p, *q; float f; int i,x,y,fini=1;
if(!h) return NULL;
for(x=0;(x<=c-2)&&fini;x++)//（冒泡法排序）
{fini=0;
p=h;q=h->next;
for(y=0;(y<=c-x-2)&&q;y++)
{if(p->expn
{ f=p->coef;i=p->expn;
p->coef=q->coef;p->expn=q->expn;
q->coef=f;q->expn=i;
fini=1;
}
p=p->next;q=q->next;
}
}
g=h;
for(p=g->next;p;)
{if(g->expn==p->expn)
{ g->coef += p->coef;
g->next = p->next;
q = p;
p = p->next;
free(q);
}
if(g->next)
{g = g->next;
p = p->next;
}
}
return h;
}
int PrintfPoly(Term *P)//输出一元多项式
{ Term *q=P;
if(!q) return 0;
do
{ if((q->coef!=1)&&(q->coef!=0)) printf("%f",q->coef);
if(q->expn==1) putchar('X');
else
if(!q->expn) putchar('1');
else printf("X^%d",q->expn);
q=q->next;
if (q) {if(q->coef>0) putchar('+');}
} while(q);
return 1;
}
int Compare(Term *a, Term *b)//比较两个多项式对应项幂次的大小
{ if (a->expn < b->expn) return -1;
else if(a->expn > b->expn) return 1;
else return 0;
}
Term* APolyn(Term *Pa, Term *Pb) // 多项式加法,建立"和多项式"。
{ Term *h, *qa = Pa, *qb = Pb, *p;
float sum;
if(!(Pa||Pb)) return NULL;
h=p=(Term*)malloc(sizeof(Term));
while(qa||qb)
{if(qa&&qb) // Pa和Pb均非空
{ switch (Compare(qa,qb))
{ case -1: // 多项式PA中当前结点的指数值小
p-> coef = qb->coef;
p-> expn = qb->expn;
qb = qb->next;
break;
case 0: // 两者的指数值相等
sum =qa->coef+qb->coef;
if (sum != 0.0) // 修改多项式PA中当前结点的系数值
{ p->coef= sum;
p-> expn = qa->expn;
qb=qb->next;
qa=qa->next;
}
break;
case 1: // 多项式PB中当前结点的指数值小
p-> coef = qa->coef;
p-> expn = qa->expn;
qa = qa->next;
break;
} // switch结束
}// if结束
else
{if (qa) {p->coef=qa->coef;p->expn=qa->expn; qa=qa->next;}
// 链接Pa中剩余结点
else { p-> coef = qb->coef;p->expn = qb->expn; qb = qb->next;}
// 链接Pb中剩余结点
}
if (qa||qb) p=p->next=(Term*)malloc(sizeof(Term));
}
return h;
} // APolyn结束
void cle(Term *first)
{Term *p=first;
while(first)
{p=first->next;
free(first);
first=p;
}
printf("\n清空操作完成。");
}
Term* AddPoly (Term *Pa)
{ int n; Term*p,*Pb;
printf("\n输入第二个一元多项式的项数:");
scanf("%d",&n);
Pb= CreatPolyn(n);
Pb= selsort(Pb);
if(Pb)
{ printf("输入的一元多项式为：");
PrintfPoly(Pa);
if(Pb->coef>0) printf("+");
PrintfPoly(Pb);
p = APolyn(Pa,Pb);
printf(" = ");
p = selsort(p);
PrintfPoly(p);
return p;
}
else return NULL;
cle(Pb); cle(p);
}
Term* BPolyn(Term *Pa, Term *Pb) // 多项式减法,建立"差多项式"。
{ int m=0;
printf("A:"); PrintfPoly(Pa); printf("\nB:"); PrintfPoly(Pb);
printf("请选择：1.A-B 2.B-A");scanf("%d",m);
while((m!=1)&&(m!=2))
{ printf("错误! 请重新选择1.A-B 2.B-A");scanf("%d",m);}
if(m==1)
{ Term *p = Pb;
while(p){ p->coef*=-1; p = p->next;}
PrintfPoly(Pa); printf(" - "); putchar('('); PrintfPoly(Pb); putchar(')'); printf(" = ");
return APolyn(Pa,p);
}
else
{ Term *p = Pa;
while(p) { p->coef *= -1; p = p->next;}
PrintfPoly(Pb); printf(" - "); putchar('('); PrintfPoly(Pa); putchar(')'); printf(" = ");
return APolyn(p,Pb);
}
}
// BPolyn结束
Term* DecPoly (Term *Pa )
{ int n; Term*p,*Pb;
puts("输入第二个一元多项式的项数");
scanf("%d",&n);
Pb = CreatPolyn(n);
Pb = selsort(Pb);
if(Pb)
{ p=BPolyn(Pa,Pb);
p=selsort(p);
PrintfPoly(p);
return p;
}
else return NULL;
cle(Pb); cle(p);
}
void Operate(Term *p)
{ int n,operation;Term*Pa=p, *Pb=NULL;
printf ("1.建立一个多项式并输出多项式\n");
printf ("2.求两个多项式之和(必须先创建),建立求和多项式并输出\n");
printf ("3.求两个多项式之差(必须先创建),建立求差多项式并输出\n");
printf ("4.删除多项式并重新输入\n");
printf ("5.退出\n");
printf ("请选择指令:");
scanf("%d",&operation);
while((operation<1)||(operation>5))
{printf("错误! 请重新输入: ");scanf("%d",&operation);}
switch(operation)
{case 1:
printf("输入一个一元多项式的项数： ");
scanf("%d",&n);
Pa= CreatPolyn(n);
Pa = selsort(Pa);
printf("输入的一元多项式为：");
PrintfPoly(Pa);
break;
case 2:
printf("输入一个一元多项式的项数： ");
scanf("%d",&n);
Pa= CreatPolyn(n);
Pa = selsort(Pa);
printf("输入的一元多项式为：");
PrintfPoly(Pa);
AddPoly (Pa);break;
case 3:
printf("输入一个一元多项式的项数： ");
scanf("%d",&n);
Pa= CreatPolyn(n);
Pa = selsort(Pa);
printf("输入的一元多项式为：");
PrintfPoly(Pa);
DecPoly (Pa);break;
case 4:
cle(Pa);
puts("重新输入一元多项式的项数： ");
scanf("%d",&n);
Pa= CreatPolyn(n);
Pa = selsort(Pa);
printf("输入的一元多项式为：");
PrintfPoly(Pa);
break;
case 5:
printf("\n");break;
}
}
void main()
{Term *p=NULL;char c;
Operate(p);
printf("\n是否继续操作? (y/n) ");
while ((c=getchar())=='\n');
while(tolower(c)!='n')
{Operate(p);
printf("是否继续操作? (y/n) ");
while ((c=getchar())=='\n');
}
cle(p);
PrintfPoly(p);
}
内容全部来源于网络收集，如有侵权，请联系网站删除：QQ：24596024