题目描述
给定两个二进制字符串,返回他们的和(用二进制表示)。
输入为非空字符串且只包含数字 1 和 0。
示例 1:
输入: a = “11”, b = “1”
输出: “100”
示例 2:
输入: a = “1010”, b = “1011”
输出: “10101”
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/add-binary
思路
题目要求实现多位二进制加法器。可以先考虑先实现一个一位二进制加法器,然后再运用这个一位二进制加法串接成多位的二进制加法,注意不要忘了处理进位。
注意学习如何将char型的vector转成string: string str(vc.begin(), vc.end())
C++
class Solution {
public:
string addBinary(string a, string b) {
string s;
// reserve为容器预留足够的空间
s.reserve(a.size() + b.size());
int c = 0, i = a.size() - 1, j = b.size() - 1;
while(i >= 0 || j >= 0 || c == 1)
{
c += i >= 0 ? a[i--] - '0' : 0;
c += j >= 0 ? b[j--] - '0' : 0;
s.push_back((c & 1) + '0');
c >>= 1;
}
reverse(s.begin(), s.end());
return s;
}
};
class Solution {
private:
int bit_add(const int a, const int b, int &cin){ // 一位加法器,cin是进位
int tmp = a + b + cin;
cin = tmp / 2;
return tmp % 2;
}
public:
string addBinary(string a, string b){
vector<char>res;
int high1 = a.size() - 1, high2 = b.size() - 1, cin = 0, sum;
while(high1 >= 0 && high2 >= 0){
sum = bit_add(a[high1--] - '0', b[high2--] - '0', cin);
res.push_back(sum + '0');
}
while(high1 >= 0){
sum = bit_add(a[high1--] - '0', 0, cin);
res.push_back(sum + '0');
}
while(high2 >= 0){
sum = bit_add(b[high2--] - '0', 0, cin);
res.push_back(sum + '0');
}
if(cin == 1) res.push_back('1');
reverse(res.begin(), res.end());
return string(res.begin(), res.end());
}
};
class Solution {
public:
string addBinary(string a, string b) {
const int lena = a.size();
const int lenb = b.size();
const size_t len = lena > lenb ? lena : lenb;
int advanced = 0;
string result;
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
for(int i = 0; i < len; ++i){
const int ai = i < lena ? a[i] -'0' : 0;
const int bi = i < lenb ? b[i] -'0' : 0;
int sum = ai + bi + advanced;
result.insert(result.begin(), sum % 2 + '0');
advanced = sum / 2;
}
if(advanced == 1)
result.insert(result.begin(), '1');
return result;
}
};