【leetcode】67 二进制求和（数组）

题目链接：https://leetcode-cn.com/problems/add-binary/submissions/

题目描述

给定两个二进制字符串，返回他们的和（用二进制表示）。

输入为非空字符串且只包含数字 1 和 0。

示例 1:

输入: a = "11", b = "1"
输出: "100"

示例 2:

输入: a = "1010", b = "1011"
输出: "10101"

代码

class Solution {
public:
    string addBinary(string a, string b) {
        int i = a.size()-1;
        int j = b.size()-1;
        bool carry = false;
        string ret;
        while (i>=0 && j>=0){
            bool m = (a[i] == '1');
            bool n = (b[j] == '1');
            a[i] = m^n^carry + '0';
            carry = int(m + n + carry) > 1;
            --i,--j;
        }
        while (i>=0){
            bool m = (a[i] == '1');
            a[i] = m^carry + '0';
            carry = m && carry;
            --i;
        }
        while (j>=0){
            bool n = (b[j] == '1');
            if(n^carry)
                a.insert(a.begin(),'1');
            else
                a.insert(a.begin(),'0');
            carry = n && carry;
            --j;
        }
        if(carry)
            a.insert(a.begin(),'1');
        return a;
    }
};

简化一下代码

class Solution {
public:
    string addBinary(string a, string b) {
        int i = a.size()-1;
        int j = b.size()-1;
        int carry = 0;
        string ret;
        while (i>=0 || j>=0 || carry!=0){
            int digitA = i >= 0? a[i--] - '0' :0;
            int digitB = j >= 0? b[j--] - '0' :0;
            ret.push_back((digitA + digitB + carry) %2 +'0');
            carry = (digitA + digitB + carry) /2; 
        }
        reverse(ret.begin(),ret.end());
        return ret;
    }
};