-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path43. Multiply Strings
57 lines (44 loc) · 1.15 KB
/
43. Multiply Strings
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
56
57
class Solution {
public:
string multiply(string num1, string num2) {
if(num1 == "0" || num2 == "0")
return "0";
int l1 = num1.length(), l2 = num2.length();
vector<int> v(l1 + l2);
//pf is power factor
int i = l2-1, pf = 0;
while(i >= 0)
{
int ival = num2[i] -'0';
int j = l1 - 1, carry = 0;
//travesing the result array from left to right
int k = v.size() - 1 - pf;
while(j>=0 || carry != 0)
{
int jval = j>=0 ? num1[j] - '0' : 0;
int prod = (ival * jval) + v[k] + carry;
v[k] = prod % 10;
carry = prod /10;
k--;
j--;
}
pf++;
i--;
}
string ans = "";
bool flag = true;
for(int i = 0; i<v.size(); i++)
{
if(v[i] == 0 && flag == true)
{
continue;
}
else
{
flag = false;
ans += (v[i] + '0') ;
}
}
return ans;
}
};