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.

在Top Sulotion里有个解释特别明了，所以粘贴过来：

第i个数跟第j个数相乘加上resule[i+j+1]，得到mul。result[i+j]+=mul/10，result[i+j+1]=mul%10。代码如下：

public class Solution {
    public String multiply(String num1, String num2) {
        int m = num1.length(), n = num2.length();
        int[] pos = new int[m + n];
        char[] n1 = num1.toCharArray();
        char[] n2 = num2.toCharArray();
        for (int i = m - 1; i >= 0; i --) {
            for (int j = n - 1; j >= 0; j --) {
                int p1 = i + j, p2 = i + j + 1;
                int mul = (n1[i] - '0') * (n2[j] - '0') + pos[p2];
                pos[p1] += mul / 10;
                pos[p2] = mul % 10;
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int num: pos) {
            if (!(sb.length() == 0 && num == 0)) {
                sb.append(num);
            }
        }
        return sb.length() == 0? "0": sb.toString();
    }
}