实验要求：顺序表类用C++的模板实现算法用流程图和伪代码的形式分别描述并分析算法时间复杂度输入大数据位数以及每一位的数字从高位到低位输出结果位数和每一位的数字从高位到低位。大整数位数不超过1000。输入数据示例如下：3 1 2 3 3位数数值为1235 1 2 3 4 5 5位数数值为12345加法结果输出数据如下：5 1 2 4 6 8 5位数数值为12468乘法结果输出数据如下：7 1 5 1

#include using namespace std;

template class SeqList { private: DataType data[1000]; int length; public: SeqList(DataType a[], int n) { length = n; for (int i = 0; i < n; i++) { data[i] = a[i]; } }

DataType Delete(int i)
{
    DataType temp = data[i];
    for (int j = i; j < length - 1; j++)
    {
        data[j] = data[j + 1];
    }
    length--;
    return temp;
}

int Length()
{
    return length;
}

DataType Get(int i)
{
    return data[i];
}

void Insert(int i, DataType x)
{
    for (int j = length - 1; j >= i; j--)
    {
        data[j + 1] = data[j];
    }
    data[i] = x;
    length++;
}

};

template SeqList Add(SeqList A, SeqList B) { SeqList C; int lengthA = A.Length(); int lengthB = B.Length(); int len = lengthA; if (lengthA < lengthB) { len = lengthB; } DataType carry = 0; for (int i = 0; i < len; i++) { DataType sum = A.Get(i) + B.Get(i) + carry; DataType digit = sum % 10; carry = sum / 10; C.Insert(i, digit); } if (carry > 0) { C.Insert(len, carry); } return C; }

template SeqList Mult(SeqList A, SeqList B) { SeqList C; int lengthA = A.Length(); int lengthB = B.Length(); int len = lengthA + lengthB; for (int i = 0; i < lengthA + lengthB; i++) { C.Insert(i, 0); } for (int i = 0; i < lengthB; i++) { DataType carry = 0; for (int j = 0; j < lengthA; j++) { DataType product = A.Get(j) * B.Get(i) + C.Get(i + j) + carry; DataType digit = product % 10; carry = product / 10; C.Insert(i + j, digit); } if (carry > 0) { C.Insert(i + lengthA, carry); } } while (C.Get(len - 1) == 0 && len > 1) { C.Delete(len - 1); len--; } return C; }

int main() { int n; cin >> n; int a[1000]; for (int i = n - 1; i >= 0; i--) { cin >> a[i]; } SeqList A(a, n);

SeqList<int> B(a, n);
SeqList<int> C = Add(A, B);
cout << C.Length() << " ";
for (int i = C.Length() - 1; i >= 0; i--)
{
    cout << C.Get(i) << " ";
}
cout << endl;

SeqList<int> D = Mult(A, B);
cout << D.Length() << " ";
for (int i = D.Length() - 1; i >= 0; i--)
{
    cout << D.Get(i) << " ";
}
cout << endl;

return 0;

}