class Solution {
public:
string multiply(string num1, string num2) {
int all = num1.length()*num2.length()+1;
string now;
for(int i=0;i<all;i++) now+='0';
for(int i=num2.length()-1;i>=0;i--){
int k = num2[i] - '0';
int sj = num2.length()-1-i;
int jw = 0; //进位
for(int j=num1.length()-1;j>=0;j--){
int m = num1[j] - '0';
int t = m*k+jw;
jw = t/10;
t %= 10;
now[sj]+=t;
if(now[sj]>'9') {
now[sj]-=10;
jw++;
}
sj++;
}
if(jw!=0) now[sj]+=jw;
}
reverse(now.begin(),now.end());
int start = 0;
while(now[start]=='0'){
start++;
}
now = now.substr(start);
if(now.length()) return now;
return "0";
}
};
c++乘法。