数据结构--稀疏矩阵

最近事情比较多，匆忙写出来应付检查的代码。

写的既不优雅，又没效率 ，还有大面积的代码重复[没脸见人]

#include <iostream>
#include <cstdio>
using namespace std;

const int MAXSIZE = 401;
class Triple {
public:
    int i, j, value;
    Triple(int ai, int aj, int avalue) {
        i = ai;
        j = aj;
        value = avalue;
    }
};
class Matrix {
public:
    Triple *data[MAXSIZE] = { nullptr };
    int row, column;
    int currentSize = 0;
    int isExist(int i, int j) {
        int begin = 1;
        while (data[begin] != nullptr) {
            if (data[begin]->i == i && data[begin]->j == j) {
                return begin;
            }
            begin++;
        }
        return -1;
    }
    void append(int i, int j, int value) {
        int location = isExist(i, j);
        if (location == -1) {
            currentSize++;
            data[currentSize] = new Triple(i, j, value);
        }
        else {
            data[location]->value += value;
        }
    }
    int getValue(int i, int j) {
        int location = isExist(i, j);
        if (location == -1) {
            return 0;
        }
        else {
            return data[location]->value;
        };
    }
};
int main()
{
    Matrix a, b, c;
    int m, s, n, v;

    cout << "进行矩阵乘法运算 m*s s*n 输入m s n" <<
        "进行矩阵加法计算 m*n 输入 m n 0" <<
        "进行矩阵减法计算 m*n 输入 m n -1" << endl;
    scanf("%d %d %d", &m, &s, &n);
    
    
    
    if (n > 0) {    //乘法
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < s; j++) {
                scanf("%d", &v);
                a.append(i, j, v);
            }
        }
        cout << "martix 1 completed" << endl;

        for (int i = 0; i < s; i++) {
            for (int j = 0; j < n; j++) {
                scanf("%d", &v);
                b.append(i, j, v);
            }
        }
        cout << "martix 2 completed" << endl;

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                for (int z = 0; z < s; z++) {
                    c.append(i, j, a.getValue(i, z) * b.getValue(z, j));
                }
            }
        }
    }
    else if (n == 0) {
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < s; j++) {
                scanf("%d", &v);
                a.append(i, j, v);
            }
        }
        cout << "martix 1 completed" << endl;

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < s; j++) {
                scanf("%d", &v);
                b.append(i, j, v);
            }
        }
        cout << "martix 2 completed" << endl;

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < s; j++) {
                    c.append(i, j, a.getValue(i, j) + b.getValue(i, j));
            }
        }
    }
    else if (n < 0) {
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < s; j++) {
                scanf("%d", &v);
                a.append(i, j, v);
            }
        }
        cout << "martix 1 completed" << endl;

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < s; j++) {
                scanf("%d", &v);
                b.append(i, j, v);
            }
        }
        cout << "martix 2 completed" << endl;

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < s; j++) {
                    c.append(i, j, a.getValue(i, j) - b.getValue(i, j));
            }
        }
    }

    int p2c = 1;
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < s; j++) {
            cout << c.getValue(i, j) << " ";
        }
        cout << endl;
    }
    return 0;
}