c语言实现顺序表稀疏多项式运算的代码

在C语言中，为了实现顺序表（数组）稀疏多项式的运算，你可以创建一个结构体来表示系数和对应的指数，然后定义函数来进行加法、减法等操作。下面是一个简单的示例，假设我们有两组稀疏多项式：

#include <stdio.h>
#include <stdlib.h>

typedef struct {
    int index;
    long long coefficient;
} SparseTerm;

typedef struct {
    SparseTerm *terms;
    int count;
} SparsePolynomial;

// 初始化一个新的稀疏多项式
SparsePolynomial* createSparsePolynomial(int size) {
    SparsePolynomial *polynomial = (SparsePolynomial*)malloc(sizeof(SparsePolynomial));
    polynomial->terms = malloc(size * sizeof(SparseTerm));
    polynomial->count = 0;
    return polynomial;
}

// 添加项到多项式
void addTerm(SparsePolynomial *poly, int exponent, long long coef) {
    if (poly->count == poly->terms.length) {
        // 扩展数组
        poly->terms = realloc(poly->terms, (poly->count + 1) * sizeof(SparseTerm));
    }
    poly->terms[poly->count].index = exponent;
    poly->terms[poly->count].coefficient = coef;
    ++poly->count;
}

// 稀疏多项式加法
SparsePolynomial* sparseAddition(SparsePolynomial *a, SparsePolynomial *b) {
    SparsePolynomial *result = createSparsePolynomial(a->count + b->count);
    for (int i = 0; i < a->count; ++i) {
        addTerm(result, a->terms[i].index, a->terms[i].coefficient);
    }
    for (int i = 0; i < b->count; ++i) {
        addTerm(result, b->terms[i].index, b->terms[i].coefficient);
    }
    return result;
}

// 示例
int main() {
    SparsePolynomial *p1 = createSparsePolynomial(5); // 假设 p1 有两个项: x^2 和 x^4 的系数分别是 1 和 2
    addTerm(p1, 2, 1);
    addTerm(p1, 4, 2);

    SparsePolynomial *p2 = createSparsePolynomial(5); // 假设 p2 有一个项: x^3 的系数是 3
    addTerm(p2, 3, 3);

    SparsePolynomial *sum = sparseAddition(p1, p2);

    for (int i = 0; i < sum->count; ++i) {
        printf("x^%d: %lld\n", sum->terms[i].index, sum->terms[i].coefficient);
    }

    free(sum->terms);
    free(sum);
    return 0;
}