浙大PTA一元多项式的乘法与加法运算

#include <iostream>

using namespace std;
typedef struct PolyNode* Polynomial;
struct PolyNode
{
    int coef, expon;
    Polynomial link;
};

Polynomial ReadPoly();
Polynomial Mult(Polynomial P1, Polynomial P2);
Polynomial Add(Polynomial P1, Polynomial P2);
void PrintPoly(Polynomial P);
void Attach(int coef, int expon, Polynomial *Rear);

int main()
{
    Polynomial P1, P2, PP, PS;
    P1 = ReadPoly();
    P2 = ReadPoly();
    PP = Mult(P1, P2);
    PrintPoly(PP);
    PS = Add(P1, P2);
    PrintPoly(PS);
    return 0;
}

Polynomial ReadPoly()
{
    int N, c, e;
    Polynomial P, t, Rear;
    P = (Polynomial)malloc(sizeof(struct PolyNode));
    P->link = NULL;
    scanf("%d", &N);
    Rear = P;
    for(int i = 1; i <= N; i++)
    {
        scanf("%d%d", &c, &e);
        Attach(c, e, &Rear);
    }
    t = P;
    P = P->link;
    free(t);
    return P;
}

void Attach(int c, int e, Polynomial *Rear)
{
    Polynomial P, t;
    P = (Polynomial)malloc(sizeof(PolyNode));
    P->link = NULL;
    P->coef = c;
    P->expon = e;
    (*Rear)->link = P;
    *Rear = P;
}
Polynomial Mult(Polynomial P1, Polynomial P2)
{
    Polynomial t1, t2, Rear, P, t;
    int c, e;
    if(!P1 || !P2)return NULL;
    P = (Polynomial)malloc(sizeof(struct PolyNode));
    P->link = NULL;
    t1 = P1; t2 = P2;
    Rear = P;
    while(t2){
        Attach(t2->coef * t1->coef, t2->expon + t1->expon, &Rear);
        t2 = t2->link;
    }
    t1 = t1->link;
    while(t1){
        t2 = P2;Rear = P;
        while(t2){
            e = t1->expon + t2->expon;
            c = t1->coef * t2->coef;
            while(Rear->link && Rear->link->expon > e)
                Rear = Rear->link;
            if(Rear->link && Rear->link->expon == e){
                if(Rear->link->coef + c)
                    Rear->link->coef += c;
                else{
                    t = Rear->link;
                    Rear->link = t->link;
                    free(t);
                }
            }
            else{
                t = (Polynomial)malloc(sizeof(struct PolyNode));
                t->coef = c;
                t->expon = e;
                t->link = Rear->link;
                Rear->link = t;
                Rear = Rear->link;
            }
            t2 = t2->link;
        }
        t1 = t1->link;
    }
    t2 = P; P = P->link; free(t2);
    return P;
}
Polynomial Add(Polynomial P1, Polynomial P2)
{
    Polynomial t1, t2, P, Rear;
    P = (Polynomial)malloc(sizeof(PolyNode));
    t1 = P1, t2 = P2;
    P->link = NULL;
    Rear = P;
    while(t1 && t2)
    {
        if(t1->expon < t2->expon)
        {
            Attach(t2->coef, t2->expon, &Rear);
            t2 = t2->link;
        }
        else if(t1->expon > t2->expon)
        {
            Attach(t1->coef, t1->expon, &Rear);
            t1 = t1->link;
        }
        else
        {
            if(t1->coef + t2->coef)
            {
                Attach(t1->coef + t2->coef, t1->expon, &Rear);
                t1 = t1->link;
                t2 = t2->link;
            }
            else
            {
                t1 = t1->link;
                t2 = t2->link;
            }
        }
    }
    while(t1)
    {
        Attach(t1->coef, t1->expon, &Rear);
        t1 = t1->link;
    }
    while(t2)
    {
        Attach(t2->coef, t2->expon, &Rear);
        t2 = t2->link;
    }
    t2 = P; P = P->link; free(t2);
    return P;
}

void PrintPoly(Polynomial P)
{
    int flag = 1;
    if(P == NULL)
    {
        printf("0 0\n");
        return;
    }
    else
    {
        while(P)
        {
            if(flag == 1)
                flag = 0;
            else
                printf(" ");
            printf("%d %d", P->coef, P->expon);
            P = P->link;
        }
        printf("\n");
        return;
    }
}

代码来源:中国大学MOOC浙江大学数据结构与算法