43 Multiply Strings

1 题目

Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.

Example 1:

Input: num1 = "2", num2 = "3"
Output: "6"

Example 2:

Input: num1 = "123", num2 = "456"
Output: "56088"

Note:

1. The length of both num1 and num2 is < 110.
2. Both num1 and num2 contain only digits 0-9.
3. Both num1 and num2 do not contain any leading zero, except the number 0 itself.
4. You must not use any built-in BigInteger library or convert the inputs to integer directly.

2 尝试解

class Solution {
public:
string multiple(string num1,char num2){
        int i = num1.size()-1;
        int extra = 0;
        string result = "";
        while(i>=0||extra){
            extra = (i>=0?int(num1[i]-'0'):0)*int(num2-'0')+extra;
            result = char(extra%10+'0') + result;
            extra = extra/10;
            i--;
        }
        return result;
    }
    string add(string num1, string num2){
        int i = num1.size()-1;
        int j = num2.size()-1;
        int extra = 0;
        string result ="";
        while(i>=0||j>=0||extra){
            extra = (i>=0?int(num1[i]-'0'):0)+(j>=0?int(num2[j]-'0'):0)+extra;
            result = char(extra%10+'0') + result;
            extra = extra/10;
            i--;
            j--;
        }
        return result;
    }
    string multiply(string num1, string num2) {
        if(num1=="0" || num2=="0") return "0";
        string result;
        for(int i = num1.size()-1; i >= 0;i--){
            string product = multiple(num2,num1[i]);
            product.insert(product.size(),num1.size()-i-1,'0');
            result = add(result,product);
        }
        return result;
    }
};

 3 标准解

string multiply(string num1, string num2) {
    string sum(num1.size() + num2.size(), '0');
    
    for (int i = num1.size() - 1; 0 <= i; --i) {
        int carry = 0;
        for (int j = num2.size() - 1; 0 <= j; --j) {
            int tmp = (sum[i + j + 1] - '0') + (num1[i] - '0') * (num2[j] - '0') + carry;
            sum[i + j + 1] = tmp % 10 + '0';
            carry = tmp / 10;
        }
        sum[i] += carry;
    }
    
    size_t startpos = sum.find_first_not_of("0");
    if (string::npos != startpos) {
        return sum.substr(startpos);
    }
    return "0";
}