-
Notifications
You must be signed in to change notification settings - Fork 1
/
AddBinary.cpp
58 lines (55 loc) · 1.52 KB
/
AddBinary.cpp
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
58
/*
Given two binary strings, return their sum (also a binary string).
For example,
a = "11"
b = "1"
Return "100".
*/
class Solution {
public:
string addBinary(string a, string b) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
int len1 = a.size();
int len2 = b.size();
int carry = 0;
string result="";
int i,j;
for(i=len1-1,j=len2-1;i>=0||j>=0;i--,j--)
{
int num = carry;
if(i>=0) num = num + (a[i]-'0');
if(j>=0) num = num + (b[j]-'0');
result += (num%2)+'0';
carry = num/2;
}
if(carry==1)
result += carry +'0';
int len = result.size();
i=0;
while(i<len/2)
{
swap(result[i],result[len-1-i]); //reverse the string, better solution is shown below
i++;
}
return result;
}
// More simpler solution
string addBinary(string a, string b) {
int len1 = a.size();
int len2 = b.size();
int carry = 0;
string result="";
int i,j;
for(i=len1-1,j=len2-1;i>=0||j>=0;i--,j--)
{
int num = carry;
if(i>=0) num = num + (a[i]-'0');
if(j>=0) num = num + (b[j]-'0');
result.insert(result.begin(), (num%2)+'0');
carry = num/2;
}
if(carry==1)
result.insert(result.begin(),carry+'0');
return result;
}