https://leetcode-cn.com/problems/multiply-strings/
思路:从后往前乘机+初始化res
string multiply(string num1, string num2) {
// num1 * num2的结果位数不会大于 num1.size() + num2.size()
string res(num1.size() + num2.size(), '0');
if (num1 == "" || num2 == "") {
return "";
}
if (num1 == "0" || num2 == "0") {
return "0";
}
for (int i = num1.size() - 1; i >= 0; i--) {
for (int j = num2.size() - 1; j >= 0; j--) {
//i和j位置的乘机会落在最后位置的i+j+1
int temp = (num1[i] - '0') * (num2[j] - '0') + (res[i + j + 1] - '0');
res[i + j + 1] = temp % 10 + '0';
res[i + j] = res[i + j] + temp / 10;
}
}
int i = 0;
//去除多余字符0
while (i < res.size() && res[i] == '0'){
i++;
}
return res.substr(i);
}