Given two binary strings, return their sum (also a binary string).
For example,
a = "11"
b = "1"
Return "100"
.
考虑有以下情况
a = "11", b = "00",即不需向前进位,且二者长度相同
a = "11", b = "0", 即不需向前进位,且二者长度不同
a = "11", b = "01", 即需向前进位,且二者长度相同
a = "11", b = "1", 即需向前,且二者长度不同
思路:
(1)先遍历短的,从最低位开始加,当进位+a+b大于等于2时,需进位。
(2)若短的已经遍历完,需判断当前进位是否为1,若为1,则对长的继续处理。
(3)若两个都已遍历完,需判断当前进位是否为1,若为1,则需在最前方+1.
class Solution {
public:
string addBinary(string a, string b) {
string c;
int alen = a.length() - 1;
int blen = b.length() - 1;
int carry = 0;
alen > blen ? c = a: c = b;
int clen = c.length() - 1;
while(alen >= 0 && blen >= 0)
{
if (a[alen] - '0' + b[blen] - '0' + carry >= 2)
{
c[clen] = a[alen] - '0' + b[blen] - '0' + carry - 2 + '0';
carry = 1;
}
else
{
c[clen] = a[alen] - '0' + b[blen] - '0' + carry + '0';
carry = 0;
}
--alen;
--blen;
--clen;
}
while(clen >= 0)
{
if (1 == carry)
{
if (c[clen] - '0' + carry >= 2)
{
c[clen] = c[clen] - '0' + carry - 2 + '0';
carry = 1;
}
else
{
c[clen] = c[clen] - '0' + carry + '0';
carry = 0;
}
}
--clen;
}
if (1 ==carry)
{
return "1" + c;
}
return c;
}
};