原题链接:43. 字符串相乘
solution:
高精度相乘,模拟小学乘法相乘,最后再进位,如下图所示:
class Solution {
public:
string multiply(string num1, string num2) {
if(num1 == "0" || num2 == "0") return "0";
int m = num1.length(),n = num2.length();
vector<int> ans(m + n, 0); //保存答案vector
vector<int> n1(m, 0); //string to vector
vector<int> n2(n, 0);
for(int i = 0;i < m;i++) n1[m - i - 1] = num1[i] - '0';
for(int j = 0;j < n;j++) n2[n - j - 1] = num2[j] - '0';
//按个相乘,不进位
for(int i = 0;i < m;i++)
for(int j = 0;j < n;j++) {
ans[i + j] += n1[i] * n2[j];
}
int t = 0;
//进位,计算结果
for(int i = 0;i < m + n;i++) {
t += ans[i];
ans[i] = t % 10;
t /= 10;
}
//去除前导0
int k = ans.size() - 1;
while (k > 0 && !ans[k]) k -- ;
string res;
while (k >= 0) res += ans[k -- ] + '0';
return res;
}
};