用链表实现多项式相加c

1、用链表实现多项式相加C. txt都是一个山的狐狸，你跟我讲什么聊斋，站在离你最近的地 方，眺望你对别人的微笑，即使心是百般的疼痛只为把你的一举一动尽收眼底.刺眼的白 色，让我明白什么是纯粹的伤害。#include<stdio. h>#include<stdlib h>#include<math. h>struet nodeint exp;float coef;struet node*next;void add_node(struct node*hl, struct node*h2);void print_node(struct node*h);struet

2、node*init_node()(st rue t node *h 二(s tmet node *) malloc (sizeof (s tmet node), *p, *q;int exp;float coef二 1.0;h-next二NULL;printf ("Please input the ployn(input 0 0 to stop):n)；p=(stmet node*)malloc(sizeof(struet node);q=(stmet node*)malloc(sizeof(struet node);for(;fabs(coef-0. 0)>1. 0e6;)(

3、scanf (f %d, &coef, &exp);if (fabs (coef-0. 0) >1. 0e6)q->next二p; p->coef=coef; p->exp=exp; p->next二NULL; add_node(h, q);printf (z，Input is finished n)； free(p) ; free (q):return (h);void add_node(struct node*hl, struet node*h2) struet node*yl二hl, *y2=h2; struct node*p,*q; yl二

4、yl-next; y2二y2->next;for(:yl |y2;)if(yl)(if (y2)if (yl->exp<y2->exp)yl=yl->next;else if (yl->exp=y2->exp) <yl->coef+=y2->coef;if(yl->coef=0)for(p=hl;p->next!二y1;p=p->next); p->next二yl-next;free (yl); yl=p->next;elseyl二yl->next;y2=y2->next;else if (y

5、l->exp>y2->exp)(structq->exp=y2->exp;for(p=hl;p->next!二y1;p=p->next); q： node*)malloc(sizeof(struct node); q->coef=y2->coef;q->next二yl;p->next二q;y2=y2->next;H else return;else if(y2)doq=(struet node*)malloc(sizeof(struet node) q->exp二y2-exp;q->coef二y2-coef;q

6、->next二NULL;for (p=hl;p->next!二y1;p=p->next);p->next二q;yl 二 q;y2=y2->next;while(y2);elsereturn;void print_node(struct node*h)if (h->next=NULL) printf Cy=0n/z);else(printfCy二)；for(;h->next;)h=h->next;if(h->exp=0) 1printf (%f： h->coef);if(h->next&&h->next-&g

7、t;coef>0.0) printf (+)；else if (h->exp=l)if (h->next&&h->next->coef>0.0) printf (+);elseprintf(fx%d, h->coef, h->exp);if (h->next&&h->next->coef>0. 0) printf(+)；Jprintf (n)；main()(st rue t node *yl 二(struct node *)malloc (sizeof (s tme t node);struet node*y2= (struct node*)malloc(sizeof(struct node); yl二init_node();printf(The first ployn is:n)； print_node(yl); y2=init_node()