02-线性结构2 一元多项式的乘法与加法运算

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

typedef struct PolyNode *Polynomial;  //自定义类型名，多项式结构体指针Polynomial

Polynomial ReadPoly();
void Attach(int c, int e, Polynomial *pRear);
Polynomial Add(Polynomial P1, Polynomial P2);
Polynomial Mult(Polynomial P1, Polynomial P2);
void PrintPoly(Polynomial P);
int Compare(int a,int b);


struct PolyNode {   //多项式每一项的数据结构
    int coef;           //系数
    int expon;          //指数
    Polynomial link;    //下一项
};


int main() {
    Polynomial P1, P2, PP, PS;
    //读多项式1、2
    P1=ReadPoly();
    P2=ReadPoly();

    //乘法并输出
    PP=Mult(P1,P2);
    PrintPoly(PP);

    //加法并输出
    PS=Add(P1,P2);
    PrintPoly(PS);

    return 0;
}

Polynomial ReadPoly() {
    Polynomial P,Rear,t;
    int c,e,N;

    scanf("%d",&N);

    P=(Polynomial)malloc(sizeof(struct PolyNode)); //链表头空结点
    P->link=NULL;
    Rear=P;

    while(N--) {
        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 *pRear) { //形成链表，指向指针的指针，注意C语言函数的值传递
    Polynomial p;
    p=(Polynomial)malloc(sizeof(struct PolyNode)); //构造结点
    p->coef=c;
    p->expon=e;
    p->link=NULL;
    (*pRear)->link=p; //连接成单链表
    *pRear=p;
}

Polynomial Add(Polynomial P1, Polynomial P2) {
    Polynomial t1,t2,t,P,Rear;
    int sum;

    t1=P1;
    t2=P2;

    P=(Polynomial)malloc(sizeof(struct PolyNode)); //链表头空结点
    P->link=NULL;
    Rear=P; //作为尾指针

    while(t1&&t2) {
        switch(Compare(t1->expon,t2->expon)) { //比较指数大小
        case 1:
            Attach(t1->coef,t1->expon,&Rear);
            t1=t1->link;
            break;
        case -1:
            Attach(t2->coef,t2->expon,&Rear);
            t2=t2->link;
            break;
        case 0:
            sum=t1->coef+t2->coef;
            if(sum)
                Attach(sum,t1->expon,&Rear);
            t1=t1->link;
            t2=t2->link;
            break;
        }
    }

    while(t1) {       //把t1或t2剩下的项连起来
        Attach(t1->coef,t1->expon,&Rear);
        t1=t1->link;
    }

    while(t2) {
        Attach(t2->coef,t2->expon,&Rear);
        t2=t2->link;
    }

    t=P;
    P=P->link;
    free(t);  //删除临时头结点

    return P;
}

Polynomial Mult(Polynomial P1, Polynomial P2) {
    Polynomial P,Rear,t1,t2,t;
    int c,e;

    if(!P1||!P2)
        return NULL;

    t1=P1;
    t2=P2;

    P=(Polynomial)malloc(sizeof(struct PolyNode)); //链表头空结点
    P->link=NULL;
    Rear=P;

    while(t2) {  //P1第一项乘P2多项式，得到P
        Attach(t1->coef*t2->coef,t1->expon+t2->expon,&Rear);
        t2=t2->link;
    }

    t1=t1->link;
    while(t1) {
        t2=P2;
        Rear=P;
        while(t2) {  //P1当前项(ci,ei)乘P2多项式.
            c=t1->coef*t2->coef;
            e=t1->expon+t2->expon;
            while(Rear->link&&Rear->link->expon>e) //找到P中比它指数大的前一项
                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 {    //P中不存在该指数的项，需新建一个结点插入
                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;
    }


    t=P;
    P=P->link;
    free(t);  //删除临时头结点

    return P;
}

void PrintPoly(Polynomial P) {
    Polynomial t=P;
    int flag=0;  //辅助调整输出格式
    if(!t) {
        printf("0 0\n");
        return;
    }
    while(t) {
        if(!flag) { //保证第一项前面没有空格
            flag=1;
        } else {
            printf(" ");
        }
        printf("%d %d",t->coef,t->expon);
        t=t->link;
    }
    printf("\n");
}

int Compare(int a, int b) {
    if(a>b)
        return 1;
    else if(a<b)
        return -1;
    else
        return 0;
}