1. 题目来源
链接:43. 字符串相乘
2. 题目解析
高精乘高精。模拟竖式乘法即可。高精的板子还是很多的,在这提供一个比较简单的写法。
时间复杂度:
O
(
n
m
)
O(nm)
O(nm)
空间复杂度:
O
(
n
+
m
)
O(n+m)
O(n+m)
代码:
class Solution {
public:
string multiply(string num1, string num2) {
vector<int> A, B;
int n = num1.size(), m = num2.size();
for (int i = n - 1; i >= 0; i -- ) A.push_back(num1[i] - '0');
for (int i = m - 1; i >= 0; i -- ) B.push_back(num2[i] - '0');
vector<int> C(n + m);
for (int i = 0; i < n; i ++ )
for (int j = 0; j < m; j ++)
C[i + j] += A[i] * B[j];
for (int i = 0, t = 0; i < C.size(); i ++ ) {
t += C[i];
C[i] = t % 10;
t /= 10;
}
int k = C.size() - 1;
while (k > 0 && !C[k]) k --;
string res;
while (k >= 0) res += to_string(C[k -- ]);
return res;
}
};