题目:
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)
{
string result;
const size_t n = a.size() > b.size() ? a.size() : b.size();//n为较长的字符串的位数
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
int carry = 0;//进位
for (size_t i = 0; i < n; i++)
{
const int ai = i < a.size() ? a[i] - '0' : 0;
const int bi = i < b.size() ? b[i] - '0' : 0;//如果还未到末尾,则取b[i],如果到末尾,则bi为0
const int val = (ai + bi + carry) % 2;//和
carry = (ai + bi + carry) / 2;//进位
result.insert(result.begin(), val + '0');//逆序插入和
}
if (carry == 1)
{
result.insert(result.begin(), '1');//如果首位还有进位,则在字符串最前面插入1
}
return result;
}
};