字符串模拟乘法#include <iostream>#include <vector>#include <string>using namespace std;string multiply(string num1, string num2) {int m = num1.size();int n = num2.size();if (m == 0 || n == 0) return &quot;0&quot;; // 边界条件,若有空字符串直接返回&quot;0&quot;// 初始化一个足够大的结果数组vector<int> result(m + n, 0);// 从个位开始,逐位乘法for (int i = m - 1; i >= 0; --i) {for (int j = n - 1; j >= 0; --j) {int mul = (num1[i] - '0') * (num2[j] - '0'); // 计算当前位的乘积int sum = mul + result[i + j + 1]; // 当前位乘积加上之前的累积值result[i + j + 1] = sum % 10; // 当前位结果result[i + j] += sum / 10; // 处理进位}}// 处理结果数组转化为字符串string res = &quot;&quot;;for (int i = 0; i < result.size(); ++i) {if (!(res.empty() &amp;&amp; result[i] == 0)) { // 跳过前导零res += to_string(result[i]);}}return res.empty() ? &quot;0&quot; : res;}int main() {string num1 = &quot;123&quot;;string num2 = &quot;456&quot;;cout << multiply(num1, num2) << endl; // 输出结果:56088return 0;}作者:徐子昂_2404020114_网络24_1链接:https://www.nowcoder.com/discuss/685892552595193856?sourceSSR=users来源:牛客网