43. Multiply Strings

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

Note:

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

规律总结：

1 . 乘法的总共位数为size1 + size2，然后去掉leading zero

2.第i位和第j位相乘，会对结果的i+j(p1)和i+j+1(p2)产生影响

3.为什么不考虑pos[p1]>=10这种情况：

The calculation is from right to left, even though pos[p1] >= 10. it’s still Ok, because current p1 will be p2 in next step, the % operation will always get right result in p2 position. finally, the overflow will end at head, but it will not overflow again. For example, 99 * 99 = 9801, 2 digit number multiplication, the result length will not exceed 4 digit.

class Solution {
public:
    string multiply(string num1, string num2) {
        int size1 = num1.size();
        int size2 = num2.size();
        int pos[size1 + size2];
        for (int i = 0; i < size1 + size2; i++) {
            pos[i] = 0;
        }
        for (int i = size1 - 1; i >= 0; i--) {
            for (int j = size2 - 1; j >= 0; j--) {
                int mul = (num1[i] - '0') * (num2[j] - '0');
                int p1 = i + j;
                int p2 = i + j + 1;
                int sum = pos[p2] + mul;
                pos[p2] =  sum % 10;
                pos[p1] =  pos[p1] + sum / 10;
            }
        }
        string res = "";
        for (int i = 0; i < size1 + size2; i++) {
            res = res + to_string(pos[i]);
        }
        size_t startpos = res.find_first_not_of("0");
        if (string::npos != startpos) {
            return res.substr(startpos);
        }
        return "0";
    }
};