PTA Data Structures and Algorithms (English) 6-3

6-3 Add Two Polynomials

Write a function to add two polynomials. Do not destroy the input. Use a linked list implementation with a dummy head node. Note: The zero polynomial is represented by an empty list with only the dummy head node.

Format of functions:

Polynomial Add( Polynomial a, Polynomial b );

where Polynomial is defined as the following:

typedef struct Node *PtrToNode;
struct Node {
    int Coefficient;
    int Exponent;
    PtrToNode Next;
};
typedef PtrToNode Polynomial;
/* Nodes are sorted in decreasing order of exponents.*/  

The function Add is supposed to return a polynomial which is the sum of a and b.

Sample program of judge:

#include <stdio.h>
#include <stdlib.h>
typedef struct Node *PtrToNode;
struct Node  {
    int Coefficient;
    int Exponent;
    PtrToNode Next;
};
typedef PtrToNode Polynomial;

Polynomial Read(); /* details omitted */
void Print( Polynomial p ); /* details omitted */
Polynomial Add( Polynomial a, Polynomial b );

int main()
{
    Polynomial a, b, s;
    a = Read();
    b = Read();
    s = Add(a, b);
    Print(s);
    return 0;
}

/* Your function will be put here */

Example: 

#include "limits.h"
Polynomial Add( Polynomial a, Polynomial b )
{
    Polynomial head = malloc(sizeof(*head));
    PtrToNode A = a->Next;
    PtrToNode B = b->Next;
    PtrToNode cur = head;
    int Coefficient;
    int Exponent;
    head->Next = NULL;
    head->Coefficient = 0;
    head->Exponent = INT_MAX;
    while(A && B) {
        if(A->Exponent > B->Exponent) {
            Coefficient = A->Coefficient;
            Exponent = A->Exponent;
            A = A->Next;
        } else if(A->Exponent < B->Exponent) {
            Coefficient = B->Coefficient;
            Exponent = B->Exponent;
            B = B->Next; 
        } else {
            Coefficient = A->Coefficient + B->Coefficient;
            Exponent = A->Exponent;
            A = A->Next;
            B = B->Next;            
        }
        if(Coefficient == 0) {
            continue;
        } else {
            PtrToNode node = malloc(sizeof(*node));
            node->Coefficient = Coefficient;
            node->Exponent = Exponent;
            cur->Next = node;
            cur = node;
        }
    }
    if(A || B) {
        PtrToNode TEMP;
        if(A)
            TEMP = A;
        else 
            TEMP = B;
        while(TEMP) {
            PtrToNode node = malloc(sizeof(*node));
            node->Coefficient = TEMP->Coefficient;
            node->Exponent = TEMP->Exponent;
            cur->Next = node;
            cur = node;
            TEMP = TEMP->Next;
        }
    }
    cur->Next = NULL;
    return head;
}