LeetCode ： Multiply Strings 一种比较快速的方法

Multiply Strings

  Total Accepted: 10282  Total Submissions: 50489 My Submissions

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.

刚开始看到题目是感觉这个题目没有什么意思，但是为了把上面的题都做完，于是就写了一下，结果代码量还不小，而且感觉不够简洁，所以就查了一下看看有没有更好的方法，结果查到了一个不错的方法，代码如下：

string multiply(string num1, string num2) {
	if(num1=="0" || num2=="0") return "0";
	int l1 = num1.length(), l2 = num2.length();
	int* n1 = new int[l1];
	int* n2 = new int[l2];
	int* res = new int[l1+l2];
	memset(res,0,sizeof(int)*(l1+l2));
	for(int i=0; i<l1; ++i)
		n1[i] = num1[i] - '0';
	for(int i=0; i<l2; ++i)
		n2[i] = num2[i] - '0';

	for(int i=0; i<l1; ++i)
		for (int j=0; j<l2; ++j)
			res[i+j+1] += n1[i]*n2[j];

	string ss = "";
	for (int k=l1+l2-1; k>=0; --k){
		if(k>0) res[k-1] += res[k]/10;
		res[k] %= 10;
		ss = char(res[k]+'0')+ss;
	}
	ss = ss[0]=='0'? ss.substr(1):ss;

	return ss;
}