数据结构C多项式的加法

1.算法思路
两个指针 P 1 P1P1 和 P 2 P2P2 分别指向这两个多项式第一个结点，不断循环：
P1->expon == P2->expon系数相加，若结果不为0，则作为结果多项式对应项的系数。同时，P 1 P1P1和P 2 P2P2部分分别指向下一项；
P1->expon>P2->expon;将 P 1 P1P1 的当前项存入结果多项式，并使 P 1 P1P1 指向下一项；
P1>exponexpon将 P 2 P2P2 的当前项存入结果多项式，并使 P 2 P2P2 指向下一项；
当某一多项式处理完时，将另一个多项式的所有结点依次复制到结果多项式中去。

2.代码

#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;
}// Of initLinkList

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

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);
    }// Of while
}// Of printNode

void appendElement(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;
    }// Of while

    p->next = q;
}// Of appendElement

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; // Previous pointer for inserting.
    printNode(r, 'r');
    free(paraList2); // The second list is destroyed.

    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');
                // free(s);
            } else {
                printf("case 3.2\r\n");
                r = p;
                printNode(r, 'r');
                p = p->next;
                printNode(p, 'p');
            }// Of if
            s = q;
            q = q->next;

            free(s);
        }// Of if

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

    if (p == NULL) {
        r->next = q;
    } else {
        r->next = p;
    } // Of if

    printf("Addition ends.\r\n");
}// Of add

void additionTest1(){

    LinkList tempList1 = initLinkList();
    appendElement(tempList1, 7, 0);
    appendElement(tempList1, 3, 1);
    appendElement(tempList1, 9, 8);
    appendElement(tempList1, 5, 17);
    printList(tempList1);

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

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

void additionTest2(){

    LinkList tempList1 = initLinkList();
    appendElement(tempList1, 7, 0);
    appendElement(tempList1, 3, 1);
    appendElement(tempList1, 9, 8);
    appendElement(tempList1, 5, 17);
    printList(tempList1);

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

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

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

运行结果

7 * 10^0 + 3 * 10^1 + 9 * 10^8 + 5 * 10^17 +
8 * 10^1 + 22 * 10^7 + -9 * 10^8 +
The element of p is (7 * 10^0)
The element of q is (8 * 10^1)
The element of r is (0 * 10^0)
case 1
The element of r is (7 * 10^0)
The element of p is (3 * 10^1)
p = 7934992, q = 7935120
case 3
The coefficient is: 11.
case 3.2
The element of r is (11 * 10^1)
The element of p is (9 * 10^8)
p = 7935024, q = 7935152
case 2
The element of r is (22 * 10^7)
The element of q is (-9 * 10^8)
p = 7935024, q = 7935184
case 3
The coefficient is: 0.
case 3.1
The element of p is (5 * 10^17)
p = 7935056, q = 0
End of while.
Addition ends.
The result is: 7 * 10^0 + 11 * 10^1 + 22 * 10^7 + 5 * 10^17 +

7 * 10^0 + 3 * 10^1 + 9 * 10^8 + 5 * 10^17 +
8 * 10^1 + 22 * 10^7 + -9 * 10^10 +
The element of p is (7 * 10^0)
The element of q is (8 * 10^1)
The element of r is (0 * 10^0)
case 1
The element of r is (7 * 10^0)
The element of p is (3 * 10^1)
p = 7935184, q = 7935312
case 3
The coefficient is: 11.
case 3.2
The element of r is (11 * 10^1)
The element of p is (9 * 10^8)
p = 7935216, q = 7935344
case 2
The element of r is (22 * 10^7)
The element of q is (-9 * 10^10)
p = 7935216, q = 7956960
case 1
The element of r is (9 * 10^8)
The element of p is (5 * 10^17)
p = 7935248, q = 7956960
case 2
The element of r is (-9 * 10^10)
NULL
p = 7935248, q = 0
End of while.
Addition ends.
The result is: 7 * 10^0 + 11 * 10^1 + 22 * 10^7 + 9 * 10^8 + -9 * 10^10 + 5 * 10^17 +

Finish.

--------------------------------
Process exited after 0.04624 seconds with return value 0
请按任意键继续. . .