[Leetcode] Multiply Strings

最新推荐文章于 2022-05-13 12:53:03 发布

最新推荐文章于 2022-05-13 12:53:03 发布 · 100 阅读

Algorithm 同时被 2 个专栏收录

80 篇文章

订阅专栏

LeetCode

80 篇文章

订阅专栏

本文介绍了一种用于字符串表示的数字相乘的方法，并详细解释了如何通过反转字符串简化计算过程，适用于任意大小的非负整数相乘。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Multiply StringsMar 12 '124253 / 16074

Given two numbers represented as strings, return multiplication of the numbers as a string.

Note: The numbers can be arbitrarily large and are non-negative.

把num reverse一下，这个技巧挺实用，可以拓展到所有的string运算中。

class Solution {
public:
    string multiply(string num1, string num2) {

        reverse(num1.begin(), num1.end());
        reverse(num2.begin(), num2.end());
        
        int l1 = num1.size();
        int l2 = num2.size();
        string res(l1 + l2 + 1, '0');
        int carr = 0, t, idx;
        for (int i = 0; i < l1; ++i)
        {
            int n1 = num1[i] - '0';
            carr = 0;
            for (int j = 0; j < l2; ++j)
            {
                t = carr + n1 * (num2[j] - '0') + (res[i + j] - '0');
                carr = t / 10;
                res[i+j] = t % 10 + '0';
            }
            idx = l2;
            while (carr != 0)
            if (carr != 0) {
                t = carr + (res[i+idx] - '0');
                carr = t / 10;
                res[i+idx++] = t % 10 + '0';
            }
        }
        while (!res.empty() && res.back() == '0') res.pop_back();
        if (res.empty()) return "0";
        reverse(res.begin(), res.end());
        return res;
    }
};