-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path43.MultiplyStrings.cpp
More file actions
52 lines (52 loc) · 1.59 KB
/
43.MultiplyStrings.cpp
File metadata and controls
52 lines (52 loc) · 1.59 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/**
* 需要实现的是字符串的加法, 然后乘法转换为单个字符与另一个字符串相乘, 然后将结果加起来.
* 单个字符的相乘可以偷懒用多次加来实现, 也可以写一个专门的乘法来实现.
*/
class Solution {
public:
string add(string num1, string num2){
string result;
int len1 = num1.size();
int len2 = num2.size();
if(len1 < len2)
return add(num2, num1);
int overflow = 0;
for(int i=0; i<len1; i++){
int d;
if(i>=len2)
d = num1[len1-1-i]-'0' + overflow;
else
d = num2[len2-1-i]-'0' + num1[len1-1-i]-'0' + overflow;
if(d>=10){
d -= 10;
overflow = 1;
}else
overflow = 0;
result.insert(0, 1, d+'0');
}
if(overflow == 1)
result.insert(0, 1, '1');
return result;
}
string multiply(string num1, string num2) {
int len1 = num1.size();
int len2 = num2.size();
if(len1 < len2)
return multiply(num2, num1);
string res = "0";
if(len2 == 1){
for(int i=0; i<num2[0]-'0'; i++)
res = add(num1, res);
} else{
for(int i=0; i<len2; i++){
string digit;
digit.push_back(num2[len2-1-i]);
string tmp = multiply(num1, digit);
for(int j=0; j<i; j++)
tmp.push_back('0');
res = add(res, tmp);
}
}
return res;
}
};