数据结构多项式的加减(方法01)
txt爱情是艺术，结婚是技术，离婚是算术
这年头女孩们都在争做小“腰”精，谁还稀罕小“腹”婆呀
高职不如高薪，高薪不如高寿，高寿不如高兴
#include #include typedef struct node //定义节点类型 {float coef; int expn; struct node * next; }PLOY; void insert(PLOY *head,PLOY *inpt) //查找位置插入新链节程序 { PLOY *pre,*now; int signal=0; pre=head; if(pre->next==NULL) {pre->next=inpt;} else {now=pre->next; while(signal==0) { if(inpt->expnexpn) { if(now->next==NULL) { now->next=inpt; signal=1; } else { pre=now; now=pre->next; } } else if(inpt->expn>now->expn) { inpt->next=now; pre->next=inpt; signal=1; } else { now->coef=now->coef+inpt->coef; signal=1; free(inpt); if(now->coef==0) { pre->next=now->next; free(now); } } } } } PLOY *creat(char ch) //输入多项式 { PLOY *head,*inpt; float x; int y; head=(PLOY *)malloc(sizeof(PLOY)); //创建链表头 head->next=NULL; scanf("%f %d",&x,&y
