一元多项式的相加.docVIP

#include stdio.h#include malloc.h#include stdlib.h#define NULL 0 typedef struct NODE {?float? coef;????????????????? //系数?int??? expn;????????????????? //指数?struct NODE *next;? }NODE; NODE *Creat(int n);void print(NODE *head);NODE *AddPolyn(NODE *head1, NODE *head2);NODE *Delfirst(NODE *head, NODE *q);void InsertBefore(NODE *p1, NODE *p2);int? compare(int a, int b); main(){?NODE *head1, *head2, *head3;?int n1, n2; ?printf(请输入你需要的多项数的数目 n1? : );??scanf(%d, n1);?head1 = Creat(n1);?printf(第一个多项式的显示 : \n);?print(head1);??? ?printf(\n请输入你需要的多项数的数目 n2? : );??scanf(%d, n2);?head2 = Creat(n2);?printf(\n第二个多项式的显示 : \n);?print(head2); ?head3 = AddPolyn(head1, head2);?printf(\n合并后的多项式的显示 : \n);?print(head3);?printf(\n);} /*创建链表*/ NODE *Creat(int n){?NODE *current, *previous, *head;?int i; ?head = (NODE *)malloc(sizeof(NODE)); /*创建头结点*/?previous = head;? ?for(i = 0; i n; i++)?{??current = (NODE *)malloc(sizeof(NODE));????printf(请输入系数和指数 : );??scanf(%f%d, current-coef, current-expn);??previous-next = current;??previous = current; ?}?previous-next = NULL;?return head;} /*一元多项式的想加，总体考虑，可分qa的指数比qb小，或等于pb(如果系数相加等于0和不等于0),或大于pb里面由InsertBefore和Delfirst两个小模块组成一部分*/NODE? *AddPolyn(NODE *head1, NODE *head2){?NODE *ha, *hb, *qa, *qb;?int a, b;?float sum; ?ha = head1;????????????????? /*ha和hb指向头结点*/?hb = head2;?qa = ha-next;???????????? /*qa和qb指向头结点的下一个结点*/?qb = hb-next; ? ?while(qa qb)???????????? /*qa和qb均非空*/?{??a = qa-expn;???b = qb-expn; ??switch(compare(a, b)) {??case -1 :????????????? /*qa-expn qb-expn*/???ha = qa;???qa = qa-next;???break;???? ??case 0 :???sum = qa-coef + qb-coef;? /*系数的和*/ ???if(sum != 0.0) {??????????? /*如果不是0.0*/????qa-coef = sum;???????? /*改变系数*/ ????ha = qa;????????????????????????????????? ???}else {????free(Delfirst(ha, qa));???}?????????????????????????????? ???free(Delfirst(hb, qb));???qa = ha-next;????????????? ???qb = hb-next;????????????? /*qb释放后要重新赋值*/???break;????case 1 :