数据结构多项式加法

#include<stdio.h>
#include<malloc.h>

typedef struct LinkNode
{
    int coefficient;
    int exponent;
    struct LinkNode *next;
} *LinkList, *NodePtr;

LinkList initLinkList()
{
    LinkList tempHeader = (LinkList)malloc(sizeof(struct LinkNode));
    tempHeader->coefficient = 0;
    tempHeader->exponent = 0;
    tempHeader->next = NULL;
    return tempHeader;
}

void printList(LinkList paraHeader)
{
    NodePtr p = paraHeader->next;
    while (p != NULL)
    {
        printf("%d * 10^%d +", p->coefficient, p->exponent);
        p = p->next;
    }
    printf("\r\n");
}

void printNode(NodePtr paraPtr, char paraChar)
{
    if (paraPtr == NULL)
    {
        printf("NULL\r\n");
    }
    else
    {
        printf("The element of %c is (%d * 10^%d)\r\n", paraChar, paraPtr->coefficient, paraPtr->exponent);
    }
}

void appendElemnet(LinkList paraHeader, int paraCoefficient, int paraExponent)
{
    NodePtr p, q;

    q = (NodePtr)malloc(sizeof(struct LinkNode));
    q->coefficient = paraCoefficient;
    q->exponent = paraExponent;
    q->next = NULL;

    p = paraHeader;
    while (p->next != NULL)
    {
        p = p->next;
    }

    p->next = q;
}

void add(NodePtr paraList1, NodePtr paraList2)
{
    NodePtr p, q, r, s;
    p = paraList1->next;
    printNode(p, 'p');
    q = paraList2->next;
    printNode(q, 'q');
    r = paraList1;
    printNode(r, 'r');
    free(paraList2);

    while((p !=NULL) && (q != NULL))
    {
        if (p->exponent < q->exponent)
        {
            printf("case 1\r\n");
            r->next = p;
            r = p;
            printNode(r, 'r');
            p = p->next;
            printNode(p, 'p');
        }
        else if((p->exponent) > (q->exponent))
        {
            printf("case 2\r\n");
            r->next = q;
            r = q;
            printNode(r, 'r');
            q = q->next;
            printNode(q, 'q');
        }
        else
        {
            printf("case 3\r\n");
            p->coefficient = p->coefficient + q->coefficient;
            printf("The coefficient is: %d.\r\n", p->coefficient);
            if (p->coefficient == 0)
            {
                printf("case 3.1\r\n");
                s = p;
                p = p->next;
                printNode(p, 'p');
            }
            else
            {
                printf("case 3.2\r\n");
                r = p;
                printNode(r, 'r');
                p = p->next;
                printNode(p, 'p');
            }
            s = q;
            q = q->next;
            free(s);
        }

        printf("p = %d, q = %ld \r\n", p, q);
    }
    printf("End of while.]\r\n");

    if (p == NULL)
    {
        r->next = q;
    }
    else
    {
        r->next = p;
    }
    printf("Addition ends.\r\n");
}

void additionTest1()
{
    LinkList tempList1 = initLinkList();
    appendElemnet(tempList1, 7, 0);
    appendElemnet(tempList1, 3, 1);
    appendElemnet(tempList1, 9, 8);
    appendElemnet(tempList1, 5, 17);
    printList(tempList1);

    LinkList tempList2 = initLinkList();
    appendElemnet(tempList2, 8, 1);
    appendElemnet(tempList2, 22, 7);
    appendElemnet(tempList2, -9, 8);
    printList(tempList2);

    add(tempList1, tempList2);
    printf("The result is: ");
    printList(tempList1);
    printf("\r\n");
}

void additionTest2()
{
    LinkList tempList1 = initLinkList();
    appendElemnet(tempList1, 7, 0);
    appendElemnet(tempList1, 3, 1);
    appendElemnet(tempList1, 9, 8);
    appendElemnet(tempList1, 5, 17);
    printList(tempList1);

    LinkList tempList2 = initLinkList();
    appendElemnet(tempList2, 8, 1);
    appendElemnet(tempList2, 22, 7);
    appendElemnet(tempList2, -9, 10);
    printList(tempList2);

    add(tempList1, tempList2);
    printf("The result is: ");
    printList(tempList1);
    printf("\r\n");
}

int main()
{
    additionTest1();
    additionTest2();
    printf("Finish.\r\n");
    return 0;
}

在老师的代码中发现了一个小问题

 这里貌似是本来想打两个括号但忘了分括号导致的

我的代码中已修改。

采用链表进行多项式相加算法，好处是算法超级容易理解。给每一个项打上标签，门当户对的才进行另一项标签（也就是数值）的操作，不然就单纯站一排输出。在运算中会用到两个表和较多指针，注意命名和注释否则搞混的话debug就坐牢了。

下面附上运行结果