單鏈表實現(xiàn)一元多項式相加
請幫我看一下這個程序有什么錯誤,
#include
#include
#include
#include
#include
#include
#include
#include
#include
typedef struct LNode
{ /*多項式的存儲結(jié)構(gòu)定義*/
int coef;
int expn;
struct LNode *next;
}LNode,*polynomail;
void creatpolyn(polynomail &p,int m)
{
int i;
int coef;
int expn;
polynomail s;
p=(polynomail)malloc(sizeof(LNode));
p->next = NULL;
for(i=1;icoef,s->expn);
printf("\n");
s->coef=coef;
s->expn=expn;
s->next=p->next;
p->next=s;
}
}//CreatPolyn
void addpolyn(polynomail &pa,polynomail &pb)
{
polynomail qa,qb,c,pc;
pc=(polynomail)malloc(sizeof(LNode));
pc->next=NULL;
qa=pa->next;
qb=pb->next;
while(qa&&qb)
{
if(qa->expn=qb->expn)
{
c=(polynomail)malloc(sizeof(LNode));
c->expn=pa->expn;
c->coef=qa->coef+qb->coef;
c->next=NULL;
qa=qa->next;
qb=qb->next;
}
if(qa->expn>qb->expn)
{
c=(polynomail)malloc(sizeof(LNode));
c->expn=qa->expn;
c->coef=qa->coef;
c->next=NULL;
qa=qa->next;
}
if(qa->expnexpn)
{
c=(polynomail)malloc(sizeof(LNode));
c->expn=qb->expn;
c->coef=qb->coef;
c->next=NULL;
qb=qb->next;
}
pc->next=c;
pc=c;
}//while
if(qa)
c->next=qa;
else
c->next=qb;
}//AddPolyn
void printpolyn(polynomail p)
{
while(p->next!=NULL)
{
p=p->next;
printf(" %g*x^%d",p->coef,p->expn);
}
}
int main()
{
int n,m;
polynomail pa,pb;
printf("請輸入一元多項式pa的項數(shù):");
scanf("%d\n",n);
printf("\n");
creatpolyn(&pa,n);
printf("請輸入一元多項式pb的項數(shù):");
scanf("%d\n",m);
printf("\n");
creatpolyn(&pb,m);
addpolyn(&pa,&pb);
printf("結(jié)果是:pa+pb=");
printpolyn(pa);
printf("\n");
return 0;
}