程序思路
直接模拟算式运算操作过程,通过嵌套for循环完成两个大整数相乘。
bool BigIntMul(const char *num1, const char *num2, char **out)
{
typedef unsigned short ui16;//分配足够空间存储乘积加和
size_t nLen1 = strlen(num1);
size_t nLen2 = strlen(num2);
size_t nMaxLen = nLen1 + nLen2;//乘积最大长度为两个乘数位数之和
ui16 *usResult = new ui16[nMaxLen];
char *szResult = new char[nMaxLen + 1];
ui16 n1, n2, nMul;
if ((NULL == usResult) || (NULL == szResult))
{
delete []usResult;
delete []szResult;
return false;
}
memset(usResult, 0, sizeof(ui16)*nMaxLen);
memset(szResult, 0, nMaxLen + 1);
*out = szResult;
//按照乘法算式逐位相乘
for (size_t i = 0; i < nLen1; ++i)
{
n1 = num1[nLen1 - i - 1] - '0';
for (size_t j = 0; j < nLen2; ++j)
{
n2 = num2[nLen2 - j - 1] - '0';
nMul = n1 * n2;
usResult[i + j] += nMul;//乘积存储位置
}
}
//获取各数据位上存储的数值
for (size_t i = 0; i < nMaxLen; ++i)
{
if (usResult[i] > 9)
{
usResult[i + 1] += usResult[i] / 10;
usResult[i] %= 10;
}
szResult[i] = (char)(usResult[i] + '0');
}
//去除多余的0
for (size_t i = nMaxLen; i > 1; --i)
{
if (szResult[i-1] == '0')
{
szResult[i-1] = '\0';
}
}
//反转获取真实乘积
_strrev(szResult);
return true;
}