[leetcode] Multiply Strings

Given two numbers represented as strings, return multiplication of the numbers as a string.

Note: The numbers can be arbitrarily large and are non-negative.

思路：将字符串转换成整型数组，用数组乘

参考链接：http://blog.csdn.net/doc_sgl/article/details/13279999

代码：

class Solution {
public:
    string multiply(string num1, string num2) {
        if(num1=="0" || num2=="0") return "0";
        int l1=num1.size(),l2=num2.size();
        int a[l1],b[l2],c[l1+l2];
        memset(c,0,sizeof(int)*(l1+l2)); 
        for(int i=0;i<l1;i++){
            a[i]=num1[i]-'0';
        }
        for(int i=0;i<l2;i++){
            b[i]=num2[i]-'0';
        }
        for(int i=0;i<l1;i++){
            for(int j=0;j<l2;j++){
                c[i+j+1]+=a[i]*b[j];
            }
        }
        string res="";
        for(int i=l1+l2-1;i>=0;i--){
            if(i>0) c[i-1]+=c[i]/10;
            c[i] %= 10;
            res=char(c[i]+'0')+res;
        }
        res= res[0]=='0'?res.substr(1):res;
        return res;
    }
};