数据结构 ：链表的应用-求两个一元多项式之和.docVIP

实验：链表的应用-求两个一元多项式之和 班级：计科114 学号：20111515415 姓名：顾晴晴 一·实验目的： 熟悉链表的基本操作，掌握用线性链表表示多项式加法运算的方法。二．实验内容： 1.实验要求 用单链表存储一元多项式，将两个存储一元多项式的单链表相加产生结果单链表。 2.源程序如下 #includestdio.h#includestdlib.htypedef struct Listnode{ int xishu; struct Listnode *next; int mi;}* Pnode;Pnode init(int t){ Pnode phead = (Pnode)malloc(sizeof(Pnode)); if(NULL == phead) { exit(-1); } Pnode ptail = phead; ptail-next = NULL; int a,b; for(int i = 0; i t; i++) { Pnode pnew = (Pnode)malloc(sizeof(Pnode)); if(NULL == pnew) { exit(-1); } printf(输入该项的系数：); scanf(%d,a); pnew-xishu = a; printf(输入幂数：); scanf(%d,b); pnew-mi = b; ptail-next = pnew; pnew-next = NULL; ptail = pnew; } return phead;}Pnode jia(Pnode p1,Pnode p2){ Pnode phead = (Pnode)malloc(sizeof(Pnode)); if(NULL == phead) { exit(-1); } Pnode ptail = phead; ptail-next = NULL; p1 = p1-next; p2 = p2-next; while(((p1 != NULL p2 == NULL) || (p1 == NULL p2 != NULL)) || p1 != NULL || p2 != NULL) { if(p1 == NULL p2 != NULL) { Pnode pnew = (Pnode)malloc(sizeof(Pnode)); if(NULL == pnew) { exit(-1); } pnew-mi = p2-mi; pnew-xishu = p2-xishu; ptail-next = pnew; pnew-next = NULL; ptail = pnew; p2 = p2-next; } else if(p1 != NULL p2 == NULL) { Pnode pnew = (Pnode)malloc(sizeof(Pnode)); if(NULL == pnew) { exit(-1); }