Add Binary: https://leetcode.com/problems/add-binary/
Given two binary strings, return their sum (also a binary string).
For example,
a = “11”
b = “1”
Return “100”.
本题关键点在于:
1. 从后往前计算,但是结果字符串应该是从最前插入每次的结果
2. 当其中一个字符串先结束时,将该字符串的每次字符值设为0
3. 都结束时,应判断最后是否有进位
class Solution {
public:
string addBinary(string a, string b) {
int m = a.size();
int n = b.size();
int sum;
int carry = 0; // 进位
int res = 0; // 余数
int A, B;
string result;
// 从后往前计算
while (m > 0 || n > 0) {
A = (m > 0) ? a[m-1]-'0' : 0;
B = (n > 0) ? b[n-1]-'0' : 0;
sum = A + B + carry;
res = sum % 2;
carry = sum / 2;
result.insert(result.begin(), '0'+res); // 插入到头部
m--, n--;
}
if (carry)
result.insert(result.begin(), '1');
return result;
}
};