forked from sureshmangs/Code
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path67. Add Binary.cpp
81 lines (63 loc) · 1.65 KB
/
67. Add Binary.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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
Given two binary strings, return their sum (also a binary string).
The input strings are both non-empty and contains only characters 1 or 0.
Example 1:
Input: a = "11", b = "1"
Output: "100"
Example 2:
Input: a = "1010", b = "1011"
Output: "10101"
Constraints:
Each string consists only of '0' or '1' characters.
1 <= a.length, b.length <= 10^4
Each string is either "0" or doesn't contain any leading zero.
class Solution {
public:
string addBinary(string a, string b) {
int carry=0;
int alen=a.length(), blen=b.length();
string res="";
while(alen && blen){
int tmp=a[alen-1]-'0'+b[blen-1]-'0'+carry;
if(tmp==3){
carry=1;
tmp=1;
} else if(tmp==2){
carry=1;
tmp=0;
}
else carry=0;
res.push_back(tmp+'0');
alen--;
blen--;
}
while(alen){
int tmp=a[alen-1]-'0'+carry;
if(tmp==3){
carry=1;
tmp=1;
} else if(tmp==2){
carry=1;
tmp=0;
}
else carry=0;
res.push_back(tmp+'0');
alen--;
}
while(blen){
int tmp=b[blen-1]-'0'+carry;
if(tmp==3){
carry=1;
tmp=1;
} else if(tmp==2){
carry=1;
tmp=0;
}
else carry=0;
res.push_back(tmp+'0');
blen--;
}
if(carry) res.push_back('1');
reverse(res.begin(), res.end());
return res;
}
};