2018拼多多（二）

有两个用字符串表示的非常大的大整数,算出他们的乘积，也是用字符串表示。不能用系统自带的大整数类型。 

输入描述:

空格分隔的两个字符串，代表输入的两个大整数

 

输出描述:

输入的乘积，用字符串表示

 

输入例子1:

72106547548473106236 982161082972751393

 

输出例子1:

70820244829634538040848656466105986748

#include<vector>
#include<iostream>
#include<algorithm>
#include<set>
#include<assert.h>
#include<string>
using namespace std;
class Solution {
public:
    string multiply(string num1, string num2) {
        string res;
        int n1 = num1.size(), n2 = num2.size();
        int k = n1 + n2 - 2, carry = 0;
        vector<int> v(n1 + n2, 0);
        for (int i = 0; i < n1; ++i) {
            for (int j = 0; j < n2; ++j) {
                v[k - i - j] += (num1[i] - '0') * (num2[j] - '0');
            }
        }
        for (int i = 0; i < n1 + n2; ++i) {
            v[i] += carry;
            carry = v[i] / 10;
            v[i] %= 10;
        }
        int i = n1 + n2 - 1;
        while (v[i] == 0) --i;
        if (i < 0) return "0";
        while (i >= 0) res.push_back(v[i--] + '0');
        return res;
    }
};
int main ()
{
    Solution A;
    string S1,S2;
    cin>>S1>>S2;
    
    cout<<A.multiply(S1,S2)<<endl;
}