C++一元多项式计算问题-课程设计说明书(6)

参考文献

[1] 王挺，周会平，贾丽丽，许锡山. C++程序设计[M]. 北京：清华大学出版社，2005 [2] 严蔚敏，吴伟民. 数据结构（C语言版）[M]. 北京：清华大学出版社，2005.

[3] 李根强. 数据结构（C++版）习题解答及实训指导[M]. 北京：中国水利水电出版社，2009.

- 15 -

附录A 源代码

#include #include #include

typedef struct Polynomial{ int coe; int exp; struct Polynomial *next;

}*Polyn,Polynomial;

void Insert(Polyn p,Polyn h) { if(p->coe==0) delete p; else{ Polyn q1,q2; q1=h;q2=h->next; while(q2&&p->expexp) { q1=q2; q2=q2->next; } if(q2&&p->exp==q2->exp) { q2->coe+=p->coe; delete p; if(!q2->coe) { q1->next=q2->next; delete q2; } } else { p->next=q2; q1->next=p; } } }

Polyn CreatePolyn(Polyn head,int m) { int i; Polyn p; p=head=new Polynomial;

head->next=NULL;

for(i=0;i>p->coe; cout<<\ 指数:\ cin>>p->exp; Insert(p,head); } return head; }

void DestroyPolyn(Polyn p) { Polyn t; while(p!=NULL) { t=p; p=p->next; delete t; } }

void PrintPolyn(Polyn P) { Polyn q=P->next; int flag=1; if(!q) { cout<<\ cout<coe>0&&flag!=1) cout<<\ if(q->coe!=1&&q->coe!=-1) { cout<coe; if(q->exp==1) cout<<\ else if(q->exp)

- 16 -

cout<<\ } else { if(q->coe==1) { if(!q->exp) cout<<\ else if(q->exp==1) cout<<\ else cout<<\ } if(q->coe==-1) { if(!q->exp) cout<<\ else if(q->exp==1) cout<<\ else cout<<\ } } q=q->next; flag++; } cout<

int compare(Polyn a,Polyn b) { if(a&&b) { if(!b||a->exp>b->exp) return 1; else if(!a||a->expexp) return -1; else return 0; } else if(!a&&b) return -1; else return 1; }

Polyn AddPolyn(Polyn pa,Polyn pb) { Polyn qa=pa->next; Polyn qb=pb->next; Polyn headc,hc,qc; hc=new Polynomial; hc->next=NULL; headc=hc; while(qa||qb)

{

qc=new Polynomial; switch(compare(qa,qb)) { case 1: { qc->coe=qa->coe; qc->exp=qa->exp; qa=qa->next; break; } case 0: { qc->coe=qa->coe+qb->coe; qc->exp=qa->exp; qa=qa->next; qb=qb->next; break; } case -1: { qc->coe=qb->coe; qc->exp=qb->exp; qb=qb->next; break; } } if(qc->coe!=0) { qc->next=hc->next; hc->next=qc; hc=qc; } else delete qc; } return headc; }

Polyn SubtractPolyn(Polyn pa,Polyn pb) { Polyn h=pb; Polyn p=pb->next; Polyn pd;

17

while(p) { p->coe*=-1; p=p->next; } pd=AddPolyn(pa,h); for(p=h->next;p;p=p->next) p->coe*=-1; return pd; }

float ValuePolyn(Polyn head,float x) { Polyn p; p=head->next; float result=0; while(p!=NULL) { result+=(p->coe)*(float)pow(x,p->exp); p=p->next; } return result; }

Polyn MultiplyPolyn(Polyn pa,Polyn pb) { Polyn hf,pf; Polyn qa=pa->next; Polyn qb=pb->next; hf=new Polynomial; hf->next=NULL; while(qa) { qb=pb->next; while(qb) { pf=new Polynomial; pf->coe=qa->coe*qb->coe; pf->exp=qa->exp+qb->exp; Insert(pf,hf); qb=qb->next; } qa=qa->next; }

return hf; }

void desktop() { system(\ cout<<\ 一元多项式的计算\ cout<<\***************\ cout<<\ 1.输出多项式a和b **\ cout<<\ 2.建立多项式a+b **\ cout<<\ 3.建立多项式a-b **\ cout<<\ 4.计算多项式a的值 **\ cout<<\ 5.建立多项式a*b **\ cout<<\ 6.重新建立多项式a和b **\ cout<<\ 7.退出 **\ cout<<\***************\ cout<<\执行操作:\}

void main() { int m,n; float x,result; char key; Polyn pa,pb,pc,pd,pf; r1: cout<<\欢迎您的使用！\ cout<<\请您初始化数据...\ cout<<\请输入多项式a的项数:\ cin>>m; pa=CreatePolyn(pa,m); cout<>n; pb=CreatePolyn(pb,n);

18

system(\system(\while(key) { desktop(); cin>>key; PrintPolyn(pa);

cout<<\输入x的值：x=\ cin>>x; result=ValuePolyn(pa,x); cout<<\多项式a值:\的

switch (key) { case'1': cout<<\多项式a：\ PrintPolyn(pa);

cout<<\多项式b：\ PrintPolyn(pb); break; case'2': pc=AddPolyn(pa,pb); cout<<\多项式a：\ PrintPolyn(pa);

cout<<\多项式b：\ PrintPolyn(pb); cout<<\多项式a+b：\ PrintPolyn(pc); DestroyPolyn(pc); break; case'3': pd=SubtractPolyn(pa,pb); cout<<\多项式a：\ PrintPolyn(pa);

cout<<\多项式b：\ PrintPolyn(pb); cout<<\多项式a-b：\ PrintPolyn(pd); DestroyPolyn(pd); break; case'4': cout<<\多项式a：\

} }

19

break; case'5': cout<<\多项式a：\ PrintPolyn(pa); cout<<\多项式b：\ PrintPolyn(pb); pf=MultiplyPolyn(pa,pb); cout<<\多项式a*b：\ PrintPolyn(pf); DestroyPolyn(pf); break; case'6': DestroyPolyn(pa); DestroyPolyn(pb); system(\ goto r1; break; case'7': DestroyPolyn(pa); DestroyPolyn(pb); exit(0); break; default: cout<<\} cout<