和使用链表进行的加法那个题非常类似,只不过十进制换成了二进制,一样的考虑进位就可以了:
这样会更快一些:
class Solution {
public:
string addBinary(string a, string b) {
int m = a.size(), n = b.size(), c = max(m, n);
string res(c+1, '0');//结果最多比a,b较长者多一位
int i = m-1, j = n-1, k = c;
int x = 0, rem = 0;
while(i >= 0 && j >= 0){
rem = (a[i] - '0' + b[j] - '0' + x) % 2;
x = (a[i] - '0' + b[j] - '0' + x) / 2;
res[k--] = char(rem+'0');
--i; --j;
}
while(i >= 0){
rem = (a[i] - '0' + x) % 2;
x = (a[i] - '0' + x) / 2;
res[k--] = char(rem+'0');
--i;
}
while(j >= 0){
rem = (b[j] - '0' + x) % 2;
x = (b[j] - '0' + x) / 2;
res[k--] = char(rem+'0');
--j;
}
if(x) res[k--] = char(x+'0');
return res[0] == '0' ? res.substr(1) : res;
}
};
为了简化操作还可以先将两个字符串变为等长的(在短的前面补 ‘0’):
class Solution {
public:
string addBinary(string a, string b) {
int m = a.size(), n = b.size();
m < n ? a = string(n-m, '0') + a : b = string(m-n, '0') + b;//让两者等长
string res(a.size()+1, '0');//结果最多比a,b较长者多一位
int i = a.size()-1, x = 0, rem = 0;
while(i >= 0){
rem = (a[i] - '0' + b[i] - '0' + x) % 2;
x = (a[i] - '0' + b[i] - '0' + x) / 2;
res[i+1] = char(rem+'0');
--i;
}
if(x) res[0] = '1';
return res[0] == '0' ? res.substr(1) : res;
}
};