数据结构课程设计报告（顺序结构、动态链表结构下的一元多项式的(3)

polynomail q; if(P==NULL)

cout<<\无项\

else if(P->next==NULL)

cout<<\

else {

cout<<\该多项式为Y=\q=P->next; i=1;

if(q->data.xishu!=0&&q->data.zhishu!=0) { }

if(q->data.zhishu==0&&q->data.xishu!=0)

cout<data.xishu;//打印第一项

cout<data.xishu<<\i++;

q=q->next; if(q==NULL) { }

while(1)//while中，打印剩下项中系数非零的项， {

if(q->data.xishu!=0&&q->data.zhishu!=0) {

if(q->data.xishu>0)

cout<<\

cout<

cout<data.xishu<<\

7

}

}

}

}

i++;

if(q->data.zhishu==0&&q->data.xishu!=0) { }

q=q->next; if(q==NULL) { }

cout<

if(q->data.xishu>0) cout<<\cout<data.xishu;

/*1、创建并初始化多项式链表*/ polynomail creatpolyn(int m) {

polynomail Head,r,s; int i;

Head=new LNode; r=Head;

for(i=0;i

8

s=new LNode;

cout<<\请输入第\项的系数和指数：\cin>>s->data.xishu>>s->data.zhishu; r->next=s; r=s;

}

r->next=NULL; if(m>1) { }

return Head;

Head=hebing(Head);

/*2、两多项式相加*/

polynomail addpolyn(polynomail pa,polynomail pb) {

polynomail s,newHead,q,p,r;int j; p=pa->next; q=pb->next; newHead=new LNode; r=newHead; while(p) { } while(q) {

s=new LNode;

s->data.xishu=q->data.xishu; s->data.zhishu=q->data.zhishu; r->next=s; r=s; q=q->next;

9

s=new LNode;

s->data.xishu=p->data.xishu; s->data.zhishu=p->data.zhishu; r->next=s; r=s; p=p->next;

}

}

r->next=NULL;

if(newHead->next!=NULL&&newHead->next->next!=NULL)//合并同类项

newHead=hebing(newHead);

cout<<\升序 1 , 降序 2\cout<<\选择:\cin>>j;

if(j==1)

arrange1(newHead);

else

arrange2(newHead);

return newHead;

/*3、两多项式相减*/

polynomail subpolyn(polynomail pa,polynomail pb) {

polynomail s,newHead,q,p,r; int j; p=pa->next;q=pb->next; newHead=new LNode; r=newHead; while(p) { } while(q)

10

s=new LNode;

s->data.xishu=p->data.xishu; s->data.zhishu=p->data.zhishu; r->next=s; r=s; p=p->next;

{

s=new LNode;

s->data.xishu=-q->data.xishu; s->data.zhishu=q->data.zhishu; r->next=s; r=s;

q=q->next;

}

r->next=NULL;

if(newHead->next!=NULL&&newHead->next->next!=NULL)//合并同类项

newHead=hebing(newHead);

cout<<\升序 1 , 降序 2\cout<<\选择:\cin>>j; if(j==1)

arrange1(newHead);

else }

/*4两多项式相乘*/

polynomail mulpolyn(polynomail pa,polynomail pb) {

polynomail s,newHead,q,p,r;

arrange2(newHead);

return newHead;

int j;

newHead=new LNode; r=newHead;

for(p=pa->next;p!=NULL;p=p->next)

for(q=pb->next;q!=NULL;q=q->next) {

s=new LNode;

11