一元多项式的相加.doc

注：正面实验题目、实验时间、姓名、学号和专业年级均不写实验目的及要求：了解和掌握链表的特点；掌握链表基本操作的实现；掌握两个一元多项式相加的算法要求完成创建多项式、一元多项式相加、显示多项式的实现。实验设备环境及要求：PC机一台，内存要求128M以上，VC+6.0集成开发环境。实验内容与步骤： 1、在VC+6.0环境中新建一个工程和C+文件；2、实现创建多项式、一元多项式相加、显示多项式算法，代码如下：#include #include #defineMAXSIZE20typedef structfloatcoef;intexp;PolyArrayMAXSIZE;typedef structPNodefloatcoef;intexp;structPNode *next;*Polynomial;void CreatePolyList(Polynomial &L, PolyArray a, int n)Polynomial s, r;inti;L = (Polynomial )malloc(sizeof(Polynomial);L-next = NULL;r = L; for(i=0;icoef = ai.coef;s-exp = ai.exp;r-next = s;r = s;r-next = NULL;void DispPoly(Polynomial L)Polynomial p = L-next;while(p!=NULL) if(p-next=NULL | p-next-coefcoef,p-exp); else printf(%gX%d+,p-coef,p-exp); p = p-next;printf(n);void AddPoly(Polynomial La, Polynomial Lb,Polynomial &Lc)Polynomial pa = La-next;Polynomial pb = Lb-next; Polynomial t,pc;Lc = pc = (Polynomial )malloc(sizeof(Polynomial);pc-next = NULL;floatsum;while(pa!=NULL & pb!=NULL)if(pa-exp exp)t = (Polynomial )malloc(sizeof(Polynomial);pc-next = t;t-next = NULL;pc = t;pc-exp = pa-exp;pc-coef = pa-coef;pa = pa-next;else if(pa-exp = pb-exp) sum = pa-coef+pb-coef; if(sum!=0) t = (Polynomial )malloc(sizeof(Polynomial); pc-next = t; t-next = NULL; pc = t; pc-exp = pa-exp; pc-coef = sum; pa = pa-next;pb = pb-next;else t = (Polynomial )malloc(sizeof(Polynomial);pc-next = t;t-next = NULL;pc = t;pc-exp = pb-exp;pc-coef = pb-coef;pb = pb-next;if(!pa) pc-next = pb; else pc-next = pa;void main()Polynomial La,Lb,Lc;PolyArraya=7,0,3,1,9,8,5,17;PolyArrayb=8,1,22,7,-9,8;CreatePolyList(La,a,4);CreatePolyList(Lb,b,3); printf(原多项式A：);DispPoly(La);printf(原多项式B：);DispPoly(Lb);AddPoly(La,Lb,Lc);printf(多项式相加：);DispPoly(Lc);实验指导与数据处理：实验结果：原多项式A：7X0+3X1+9X8+5X17 原多项式B：8X1+22X7-9X8 多项式相加：7X0+11X122X7+5X17