大整数乘法:43. 字符串相乘 - 力扣(LeetCode) (leetcode-cn.com)
不能以正常算数的方法来做,不然太麻烦
num1的长度为m,num2的长度为n,那么num1*num2的长度最长为m+n,最短为m+n-1
证明:
由于num1和num2的乘积最大长度为m+n,因此创建长度为m+n的数组arr来存储成绩。对于任意num1[i]*num2[j]的结果位于arr[i+j]与arr[i+j+1] ,i+j处存储进位,i+j+1处存储余数
class Solution {
public:
string multiply(string num1, string num2) {
int n1 = num1.size() - 1, n2 = num2.size() - 1;
if(n1 < 0 || n2 < 0) return "";
int a[n1 + n2 + 2];
memset(a,0,sizeof a);
for(int i = n1 ; i >= 0; i--){
for(int j = n2 ; j >= 0; j--){
int bitmul = (num1[i] - '0')*(num2[j] - '0');
bitmul += a[i+j+1];
a[i+j] += bitmul /10;
a[i+j+1] = bitmul % 10;
}
}
string str;
int k = n1+n2+10;
for(int i = 0 ; i < n1+n2+2 ; i++) {
if( a[i] != 0){
k = i;
break;
}
}
for(int j = k ; j < n1+n2+2 ; j++){
str += a[j] +'0';
}
if(str.size() == 0) return "0";
return str;
}
};
大整数加法:415. 字符串相加 - 力扣(LeetCode) (leetcode-cn.com)
普通:
class Solution {
public:
string addStrings(string num1, string num2) {
reverse(num1.begin(),num1.end());
reverse(num2.begin(),num2.end());
return add(num1,num2);
}
string add(string num1 , string num2) {
if(num1.size() < num2.size()) return add(num2,num1);
string str;
int x = 0;
for(int i = 0 ; i < num1.size() ; i++){
x += (num1[i] - '0');
if(i < num2.size()) x += (num2[i] - '0');
str.push_back(x % 10 +'0');
x /= 10;
}
if(x) str.push_back(x +'0');
reverse(str.begin(),str.end());
return str;
}
};
进阶:
class Solution {
public:
string addStrings(string num1, string num2) {
int n1 = num1.size() -1;
int n2 = num2.size() - 1;
int carry = 0;
string ans;
while (n1 >= 0 || n2 >= 0 || carry> 0){
int t1 = n1 >= 0 ? num1[n1--] - '0' : 0;
int t2 = n2 >= 0 ? num2[n2--] - '0' : 0;
ans += (t1 +t2 + carry) % 10 + '0';
carry = (t1 +t2 + carry)/10;
}
reverse(ans.begin(),ans.end());
return ans;
}
};