7-2 一元多项式的乘法与加法运算

题目描述

设计函数分别求两个一元多项式的乘积与和。

输入格式:
输入分2行，每行分别先给出多项式非零项的个数，再以指数递降方式输入一个多项式非零项系数和指数（绝对值均为不超过1000的整数）。数字间以空格分隔。

输出格式:
输出分2行，分别以指数递降方式输出乘积多项式以及和多项式非零项的系数和指数。数字间以空格分隔，但结尾不能有多余空格。零多项式应输出0 0。

输入样例:
4 3 4 -5 2  6 1  -2 0
3 5 20  -7 4  3 1
输出样例:
15 24 -25 22 30 21 -10 20 -21： 8 35 6 -33 5 14 4 -15 3 18 2 -6 1
5 20 -4 4 -5 2 9 1 -2 0

思路：① 相加时注意指数相同，系数相加为零时不再记入链表；
②相乘：首先让第一个多项式的第一项与第二个多项式所有项相乘，再从第一个多项式的第二项开始遍历补充；

（带头结点）
#include<stdio.h>
#include<stdlib.h>
typedef struct PolyNode{
    int coef;
    int expon;
    struct PolyNode *next;
}PolyNode,*PolyNomial;
void Attach(int c,int e,PolyNomial *pRear);
PolyNomial ReadPoly();
PolyNomial Add(PolyNomial p1,PolyNomial p2);
PolyNomial mult(PolyNomial p1,PolyNomial p2);
void PrintPoly(PolyNomial p);
int main()
{
    PolyNomial p1,p2,pAdd,pMult;
    p1 = ReadPoly();
    p2 = ReadPoly();
    pMult = mult(p1,p2);
    pAdd = Add(p1,p2);
    PrintPoly(pMult);
    PrintPoly(pAdd);
    return 0;
}
void Attach(int c,int e,PolyNomial *pRear)
{
    PolyNomial q = (PolyNomial)malloc(sizeof(struct PolyNode));
    q->coef = c;
    q->expon = e;
    q->next = NULL;
    (*pRear) -> next = q;
    (*pRear) = q;
}
PolyNomial ReadPoly()
{
    int c,e,n;
    PolyNomial q,rear;
    scanf("%d",&n);
    q = (PolyNomial)malloc(sizeof(struct PolyNode));
    q->next = NULL;
    rear = q;
    while(n--)
    {
        scanf("%d%d",&c,&e);
        Attach(c,e,&rear);
    }
    return q;
}
PolyNomial Add(PolyNomial p1,PolyNomial p2)
{
    PolyNomial p3,q;
    int sum;
    p3 = (PolyNomial)malloc(sizeof(struct PolyNode));
    p3->next = NULL;
    q = p3;
    p1 = p1->next;
    p2 = p2->next;
    while(p1&&p2)
    {
        if(p1->expon>p2->expon)
        {
            Attach(p1->coef,p1->expon,&q);
            p1 = p1->next;
        }
        else if(p1->expon<p2->expon)
        {
            Attach(p2->coef,p2->expon,&q);
            p2 = p2->next;
        }
        else
        {
            sum = p1->coef+p2->coef;
            if(sum){
                Attach(sum,p1->expon,&q);
            }
             p1 = p1->next; //不要放在上边的if里边，不然如果有sum=0的情况代码会一直循环
             p2 = p2->next;
        }
    }
    if(p1)
        q->next = p1;    
    else
        q->next = p2;
        //不需要再加q->next = NULL
    return p3;
}
PolyNomial mult(PolyNomial p1,PolyNomial p2)
{
    int c,e;
    PolyNomial p3,q,t1,t2,t;
    p3 = (PolyNomial)malloc(sizeof(struct PolyNode));
    p3->next = NULL;
    q = p3;
    p1 = p1->next;
    p2 = p2->next;
    t1 = p1;
    t2 = p2;
    if(!p1||!p2) return p3;//如果直接返回NULL，当输入有零多项式时输出错误。
    while(t2)
    {
        Attach(t1->coef*t2->coef,t1->expon+t2->expon,&q);
        t2 = t2->next;
    }
    t1 = t1->next;
    while(t1)
    {
        t2 = p2,q = p3;
        while(t2)
        {
            c = t1->coef*t2->coef;
            e = t1->expon+t2->expon;
            while(q->next&&q->next->expon>e)
                q = q->next;
            if(q->next&&q->next->expon == e)
            {
                if(q->next->coef+c){
                    q->next->coef += c;
                }
                else
                {
                    t = q->next;
                    q->next = t->next;
                    free(t);
                }
            }
            else
            {
                t = (PolyNomial)malloc(sizeof(struct PolyNode));
                t->coef = c;
                t->expon = e;
                t->next = q->next;
                q->next = t;
                q = q->next;
            }
            t2 = t2->next;
        }
        t1 = t1->next;
    }
    return p3;
}
void PrintPoly(PolyNomial p)
{
    if(!p->next)
    {
        printf("0 0\n");
        return;
    }
    p = p->next;
    while(p)
    {
        printf("%d %d",p->coef,p->expon);
        p = p->next;
        if(p)
            printf(" ");
    }
    printf("\n");
}