43. Multiply Strings

题目：

解答：

将乘法展开为分布乘法之和即可。

代码：

class Solution {
public:
    void reverse(string& s){
        for(int i = 0;i < s.size() / 2; ++i){
            swap(s[i], s[s.size()-1-i]);
        }
    }
    string multiply(string num1, string num2) {
        int len1 = num1.size(), len2 = num2.size();
        if(num1 == "0" || num2 == "0")  return "0";
        reverse(num1);
        reverse(num2);
        vector<int> result(len1 + len2, 0);
        for(int i = 0;i < len1; ++i){
            if(num1[i] == '0')  continue;
            int num = num1[i] - '0';
            int flag = 0;
            for(int j = 0;j < len2; ++j){
                int val = num2[j] - '0';
                int tmp = result[i+j] + num * val + flag;
                result[i+j] = tmp % 10;
                flag = tmp / 10;
            }
            if(flag > 0)
                result[i+len2] = flag;
        }
        int len = 0;
        if(result[len1+len2-1] == 0)
            len = len1 + len2 - 1;
        else
            len = len1 + len2;
        
        string s(len, '0');
        for(int i = 0;i < len; ++i){
            s[i] = (result[len-1-i] + '0');
        }
        return s;
    }
};

更新会同步在我的网站更新(https://zergzerg.cn/notes/webnotes/leetcode/index.html)