題目
Given two binary strings, return their sum (also a binary string).
For example,
a = "11"
b = "1"
Return "100".
分析
和上一題差不多画饥，就是結(jié)合了字符串處理土匀，不多說邻吞。
實現(xiàn)
class Solution {
public:
string addBinary(string a, string b) {
string ans;
int i=a.size()-1, j=b.size()-1, carry = 0;
while(i>=0 && j>=0){
int n = a[i]-'0' + b[j]-'0' + carry;
carry = n/2;
ans += n%2 + '0';
i--; j--;
}
while(i>=0){
int n = a[i]-'0' + carry;
carry = n/2;
ans += n%2 + '0';
i--;
}
while(j>=0){
int n = b[j]-'0' + carry;
carry = n/2;
ans += n%2 + '0';
j--;
}
if(carry) ans += '1';
reverse(ans.begin(), ans.end());
return ans;
}
};
思考
無
