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) {
int lena = a.size();
int lenb = b.size();
string s;
int flag = 0;
while (lena > 0 && lenb > 0) {
int sum = a[lena - 1] - '0' + b[lenb - 1] - '0' + flag;
if (sum > 1) {
sum -= 2;
flag = 1;
}
else {
flag = 0;
}
sum += '0';
s += sum;
--lena;
--lenb;
}
if (lena != 0) {
while (lena > 0) {
int sum = a[lena - 1] - '0' + flag;
if (sum > 1) {
sum -= 2;
flag = 1;
}
else {
flag = 0;
}
sum += '0';
s += sum;
--lena;
}
}
else {
while (lenb > 0) {
int sum = b[lenb - 1] - '0' + flag;
if (sum > 1) {
sum -= 2;
flag = 1;
}
else {
flag = 0;
}
sum += '0';
s += sum;
--lenb;
}
}
if (flag)
s += '1';
reverse(s.begin(), s.end());
return s;
}
};