高精度加法，乘法板子_字符串高精度乘法板子-CSDN博客

本文链接：https://blog.csdn.net/JK01WYX/article/details/136024117

文章详细描述了两个C++函数，分别实现高精度的字符串加法和乘法，通过字符数组处理每一位的进位和结果存储。

摘要由CSDN通过智能技术生成

High precision addition

string hpa(string str1,string str2)
{
    int a[10000] = { 0 }, b[10000] = { 0 }, c[10000] = { 0 };
    int len1 = str1.size(), len2 = str2.size();
    //`len1>=len2
    if (len2 > len1)swap(str1, str2), swap(len1, len2);
    for (int i = 0; i < len1; i++)
        a[i] = str1[len1-1-i] - '0';
    for (int i = 0; i < len2; i++)
        b[i] = str2[len2-1-i] - '0';
    for (int i = 0; i < len1; i++)
    {
        c[i + 1] = (a[i] + b[i] + c[i])/10;
        c[i] = (c[i] + a[i] + b[i]) % 10;
    }
    if (c[len1] != 0)len1++;
    string ret;
    for (int i = len1 - 1; i >= 0; i--)
    {
        ret += '0' + c[i];
    }
    return ret;
}

High precision multiplication

//     999
//     999
//----------
//    8991
//   8991
//  8991
//  123456

string hpm(string str1,string str2)
{
    int a[10000] = { 0 }, b[10000] = { 0 }, c[10000] = { 0 };
    int len1 = str1.size(), len2 = str2.size();
    for (int i = 0; i < len1; i++)
        a[i] = str1[len1 - 1 - i] - '0';
    for (int i = 0; i < len2; i++)
        b[i] = str2[len2 - 1 - i] - '0';
    for (int i = 0; i < len1; i++)
    {
        for (int j = 0; j < len2; j++)
        {
            c[i + j] += a[i] * b[j];//也可以顺便在最后处理
        }
    }
    int len = len1 + len2;
    for (int i = 0; i < len; i++)
    {
        c[i + 1] += c[i] / 10;
        c[i] = c[i] % 10;
    }
    while (c[len - 1] == 0&&len>1/**/)
    {
        len--;
    }
    string ret;
    for (int i = len - 1; i >= 0; i--)
    {
        ret += '0' + c[i];
    }
    return ret;
}