forked from timoncui/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMultiply_Strings.cpp
More file actions
55 lines (49 loc) · 1.46 KB
/
Multiply_Strings.cpp
File metadata and controls
55 lines (49 loc) · 1.46 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
53
54
55
/*
Author: Timon Cui, [email protected]
Title: Multiply Strings
Description:
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.
Difficulty rating:
Source:
http://www.leetcode.com/onlinejudge
Notes:
*/
class Solution {
public:
string multiply(string num1, string num2) {
string res = "0";
for (int i = 0; i < num1.size(); ++i) {
res = add(res, multiply(num1[i] - '0', num1.size() - i - 1, num2));
}
// Remove prefix 0
int i = 0;
while (i < res.size() && res[i] == '0') i ++;
res = res.substr(i, res.size());
return res.size() ? res : "0";
}
private:
string multiply(int v, int k, const string& x) {
int carry = 0;
string p(x.size(), '0');
for (int i = x.size() -1; i >= 0; --i) {
int sum = carry + v * (x[i] - '0');
p[i] = (sum % 10) + '0';
carry = sum / 10;
}
if (carry) p = string(1, carry + '0') + p;
return p + string(k, '0');
}
string add(string a, string b) {
if (a.size() < b.size()) swap(a, b);
string s(a.size(), '0');
int carry = 0, offset = a.size() - b.size();
for (int i = a.size() - 1; i >= 0; --i) {
int sum = carry + a[i] - '0' + (i >= offset ? b[i - offset] - '0' : 0);
s[i] = (sum % 10) + '0';
carry = sum / 10;
}
if (carry) s = string(1, carry + '0') + s;
return s;
}
};