数据结构—一元多项式合并（C语言）

#include <stdio.h>
#include <stdlib.h>

typedef struct Poly{
    float coef; //系数
    int expn; //指数
    struct Poly *next; //指针
}Term;

void InitTerm(Term *L){
    L = (Term *)malloc(sizeof(Term));
     //a指向头节点，a->next指向首元结点
    L->next = NULL;
}

//建立单链表（头插法）
void CreateTerm(Term *L){
    int n;
    printf("请输入多项式项数：");
    scanf("%d",&n);
    printf("请输入倒序输入多项式的系数、指数：");
    for(int i=n;i>0;--i){
        Term *p = (Term *)malloc(sizeof(Term));
        scanf("%f%d",&p->coef,&p->expn);
        p->next = L->next;
        L->next = p;
    }
}

void MergeTerm(Term *La,Term *Lb,Term *Lc){
    Term *pa = La->next;
    Term *pb = Lb->next;
    Term *pc = Lc;
    while (pa&&pb) {
        if(pa->expn < pb->expn){
            pc->next = pa;
            pc = pa;
            pa = pa->next;
        }
        else if((pa->expn == pb->expn)&&(pa->coef+pb->coef!=0)){
            pa->coef = pa->coef + pb->coef;
            pc->next = pa;
            pc = pa;
            pa = pa->next;
            pb = pb->next;
        }
        else if((pa->expn == pb->expn)&&(pa->coef+pb->coef==0)){
            pa = pa->next;
            pb = pb->next;
        }
        else if(pa->expn > pb->expn){
            pc->next = pb;
            pc = pb;
            pb = pb->next;
        }
    }
    pc->next = pa?pa:pb;
}

//输出链表
void printfPoly(Term *L){
    Term *p;
    p = L->next;
    while(p){
        printf("(%.2f %d)、 ",p->coef,p->expn);
        p = p->next;
    }
    printf("\n");
}

int main(int argc, const char * argv[]) {
    //多项式合并
    Term La,Lb,Lc;
    InitTerm(&La);
    InitTerm(&Lb);
    InitTerm(&Lc);
    
    CreateTerm(&La);
    CreateTerm(&Lb);
    
    MergeTerm(&La, &Lb, &Lc);
    printf("合并后Lc的各项：");
    printfPoly(&Lc); 
}