C语言多项式乘法模拟,急!!!!c语言:求n次多项式的加法和乘法
該樓層疑似違規(guī)已被系統(tǒng)折疊?隱藏此樓查看此樓
if(s->data.coef!=0.0)
{
s->data.expn=p->data.expn;
r->next=s;
r=s;
}
p=p->next;
q=q->next;
break;
case?1:
s->data.coef=q->data.coef;
s->data.expn=q->data.expn;
r->next=s;
r=s;
q=q->next;
break;
}//switch
}//while
/*if(p!=NULL)
r->next=p;
else
if(q!=NULL)
r->next=q;
else
r->next=NULL;*/?//這樣不行，q，p為局部變量，傳不到主函數(shù)中去
while(p)
{
s=(LNode*)malloc(sizeof(LNode));
s->data.coef=p->data.coef;
s->data.expn=p->data.expn;
r->next=s;
r=s;
p=p->next;
}
while(q)
{
s=(LNode*)malloc(sizeof(LNode));
s->data.coef=q->data.coef;
s->data.expn=q->data.expn;
r->next=s;
r=s;
q=q->next;
}
r->next=NULL;
for(q=newp->next;q->next!=NULL;q=q->next)//合并同類項(xiàng)
for(p=q;p!=NULL&&p->next!=NULL;p=p->next)
if(q->data.expn==p->next->data.expn)
{
q->data.coef=q->data.coef+p->next->data.coef;
r=p->next;
p->next=p->next->next;
free(r);
}
return?newp;
}
/*3、兩多項(xiàng)式相減*/
polynomail?subpolyn(polynomail?pa,polynomail?pb)
{
polynomail?s,newp,q,p,r,Q;
p=pa->next;q=pb->next;
newp=(LNode*)malloc(sizeof(LNode));
r=newp;
while(p&&q)
{
s=(LNode*)malloc(sizeof(LNode));
switch(cmp(p->data,q->data))
{
case?-1:
s->data.coef=p->data.coef;
s->data.expn=p->data.expn;
r->next=s;
r=s;
p=p->next;
break;
case?0:
s->data.coef=p->data.coef-q->data.coef;
if(s->data.coef!=0.0)
{
s->data.expn=p->data.expn;
r->next=s;
r=s;
}
p=p->next;
q=q->next;
break;
case?1:
s->data.coef=-q->data.coef;
s->data.expn=q->data.expn;
r->next=s;
r=s;
q=q->next;
break;
}//switch
}//while
while(p)
{
s=(LNode*)malloc(sizeof(LNode));
s->data.coef=p->data.coef;
s->data.expn=p->data.expn;
r->next=s;
r=s;
p=p->next;
}
while(q)
{
s=(LNode*)malloc(sizeof(LNode));
s->data.coef=-q->data.coef;
s->data.expn=q->data.expn;
r->next=s;
r=s;
q=q->next;
}
r->next=NULL;
if(newp->next!=NULL&&newp->next->next!=NULL)//合并同類項(xiàng)
{
for(q=newp->next;q!=NULL;q=q->next)
for(p=q->next,r=q;p!=NULL;)
if(q->data.expn==p->data.expn)
{
q->data.coef=q->data.coef+p->data.coef;
r->next=p->next;
Q=p;p=p->next;
free(Q);
}
else
{
r=r->next;
p=p->next;
}
}
return?newp;
}
/*4、銷毀已建立的兩個多項(xiàng)式*/
void?delpolyn(polynomail?pa,polynomail?pb)
{
polynomail?p,q;
p=pa;
while(p!=NULL)
{
q=p;
p=p->next;
free(q);
}
p=pb;
while(p!=NULL)
{
q=p;
p=p->next;
free(q);
}
printf("兩個多項(xiàng)式已經(jīng)銷毀\n");
}
void?main()
{
polynomail?pa=NULL,pb=NULL;
polynomail?addp=NULL,subp=NULL,p,q;
int?n,m;
char?sign='y';
printf("1、創(chuàng)建兩個一元多項(xiàng)式\n");
printf("2、兩多項(xiàng)式相加得一新多項(xiàng)式\n");
printf("3、兩多項(xiàng)式相減得一新多項(xiàng)式\n");
printf("4、銷毀已建立的兩個多項(xiàng)式\n");
printf("5、退出\n");
printf("\n");
while(sign!='n')
{
printf("請選擇：");
scanf("%d",&n);
switch(n)
{
case?1:
if(pa!=NULL)
{
printf("已建立兩個一元多項(xiàng)式，請選擇其他操作！");
break;
}
printf("請輸入第一個多項(xiàng)式：\n");
printf("要輸入幾項(xiàng)：");
scanf("%d",&m);
while(m==0)
{
printf("m不能為0，請重新輸入m:");
scanf("%d",&m);
}
pa=creatpolyn(pa,m);
printpolyn(pa);
printf("請輸入第二個多項(xiàng)式：\n");
printf("要輸入幾項(xiàng)：");
scanf("%d",&m);
pb=creatpolyn(pb,m);
printpolyn(pb);
break;
case?2:
if(pa==NULL)
{
printf("請先創(chuàng)建兩個一元多項(xiàng)式！\n");
break;
}
addp=addpolyn(pa,pb);
printpolyn(addp);
break;
case?3:
if(pa==NULL)
{
printf("請先創(chuàng)建兩個一元多項(xiàng)式！\n");
break;
}
subp=subpolyn(pa,pb);
printpolyn(subp);
break;
case?4:
if(pa==NULL)
{
printf("請先創(chuàng)建兩個一元多項(xiàng)式！\n");
break;
}
delpolyn(pa,pb);
pa=pb=NULL;
break;
case?5:
if(addp!=NULL)
{
p=addp;
while(p!=NULL)
{
q=p;
p=p->next;
free(q);
}
}
if(subp!=NULL)
{
p=subp;
while(p!=NULL)
{
q=p;
p=p->next;
free(q);
}
}
exit(-2);
}//switch
}//while
}
總結(jié)
以上是生活随笔為你收集整理的C语言多项式乘法模拟,急!!!!c语言:求n次多项式的加法和乘法的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。
- 上一篇： SharePoint at .NET技术
- 下一篇： oracle确实表达式,ORACLE正规