leetcode由易入难——【1】Add Binary



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();
        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;
            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');
            
        }
        return result;
    }
};

解法二：

class Solution {
public:
    string addBinary(string a, string b) 
    {
        string result;
        int i = a.length() - 1,j = b.length() - 1;
        int ai, bi, val, carry;
        ai = bi = val = carry = 0;
        while (i >= 0 || j >= 0)
        {
            ai = i < 0 ? 0 : a[i] - '0';
            bi = j < 0 ? 0 : b[j] - '0';
            val = (ai + bi + carry) % 2;
            carry = (ai + bi + carry) / 2;
            result.push_back(val + '0');
            i--;
            j--;
        }
        if (carry == 1)
            result.push_back('1');
        reverse(result.begin(), result.end());
        return result;
    }
};