用C语言设计实现两个链式存储的一元多项式加法的 运算

在C语言中，设计一个用于一元多项式的链式存储结构，并实现加法操作，可以按照以下步骤进行：

1. 定义一个结构体`Term`，表示多项式的项，包含系数和指数两部分：

typedef struct Term {
    double coefficient; // 系数
    int exponent;       // 指数
} Term;

2. 定义另一个结构体`Polynomial`，作为链表的头结点，包含一个指向`Term`的指针以及链表的长度：

typedef struct Polynomial {
    Term* terms;
    size_t length;
} Polynomial;

3. 初始化函数，创建一个新的多项式：

Polynomial* createPolynomial() {
    Polynomial* poly = malloc(sizeof(Polynomial));
    poly->terms = NULL;
    poly->length = 0;
    return poly;
}

4. 添加项到多项式：

void addTerm(Polynomial* poly, double coefficient, int exponent) {
    if (poly->length == 0 || poly->terms[poly->length - 1].exponent < exponent) {
        Term* new_term = malloc(sizeof(Term));
        new_term->coefficient = coefficient;
        new_term->exponent = exponent;
        poly->terms = realloc(poly->terms, sizeof(Term) * (poly->length + 1));
        poly->terms[poly->length] = *new_term;
    } else {
        poly->terms[poly->length - 1].coefficient += coefficient * pow(10, exponent - poly->terms[poly->length - 1].exponent);
    }
    poly->length++;
}

5. 实现两个多项式的加法：

void addPolynomials(Polynomial* result, const Polynomial* poly1, const Polynomial* poly2) {
    for (size_t i = 0; i < poly1->length; i++) {
        addTerm(result, poly1->terms[i].coefficient, poly1->terms[i].exponent);
    }
    for (size_t i = 0; i < poly2->length; i++) {
        addTerm(result, poly2->terms[i].coefficient, poly2->terms[i].exponent);
    }
}

6. 打印多项式结果（这里仅展示如何打印第一个多项式，实际应用需要提供完整功能）：

void printPolynomial(const Polynomial* poly) {
    printf("( ");
    for (size_t i = 0; i < poly->length; i++) {
        printf("%.2f*x^%d ", poly->terms[i].coefficient, poly->terms[i].exponent);
    }
    printf(" )");
}

int main() {
    Polynomial poly1 = createPolynomial();
    // ...添加项到poly1...
    Polynomial poly2 = createPolynomial();
    // ...添加项到poly2...

    Polynomial sum = createPolynomial();
    addPolynomials(&sum, &poly1, &poly2);

    printPolynomial(&sum);
    free(poly1.terms);
    free(poly2.terms);
    free(sum.terms);
    return 0;
}