LeetCode 刷题记录 67. Add Binary

题目：
Given two binary strings, return their sum (also a binary string).

The input strings are both non-empty and contains only characters 1 or 0.

Example 1:

Input: a = “11”, b = “1”
Output: “100”
Example 2:

Input: a = “1010”, b = “1011”
Output: “10101”
c++：
正常的二进制加法

class Solution {
public:
    string addBinary(string a, string b) {
        string res = "";
        int n = a.size() - 1;
        int m = b.size() - 1;
        int carry = 0;
        while(n >= 0 || m >= 0){
            int num1 = n >= 0 ? a[n] - '0' : 0;
            int num2 = m >= 0 ? b[m] - '0' : 0;
            int sum = num1 + num2 + carry;
            int num = sum % 2;
            res = to_string(num) + res;
            carry = sum / 2;
            n--;
            m--;
        }
        return carry == 1 ? "1" + res : res;
    }
};

java：
java中insert效率较低，用append函数最后在反转相对好一些

class Solution {
    public String addBinary(String a, String b) {
        StringBuilder res = new StringBuilder();
        int n = a.length() - 1;
        int m = b.length() - 1;
        int carry = 0;
        while(n >= 0 || m >= 0){
            int num1 = n >= 0 ? a.charAt(n) - '0' : 0;
            int num2 = m >= 0 ? b.charAt(m) - '0' : 0;
            int sum = num1 + num2 + carry;
            int num = sum % 2;
            res.insert(0,num);
            carry = sum / 2;
            n--;
            m--;
        }
        if(carry == 1){
            res.insert(0,1);
        }
        return res.toString();
    }
}

class Solution {
    public String addBinary(String a, String b) {
        StringBuilder res = new StringBuilder();
        int n = a.length() - 1;
        int m = b.length() - 1;
        int carry = 0;
        while(n >= 0 || m >= 0){
            int num1 = n >= 0 ? a.charAt(n) - '0' : 0;
            int num2 = m >= 0 ? b.charAt(m) - '0' : 0;
            int sum = num1 + num2 + carry;
            int num = sum % 2;
            res.append(num);
            carry = sum / 2;
            n--;
            m--;
        }
        if(carry == 1){
            res.append(1);
        }
        return res.reverse().toString();
    }
}

python:

class Solution(object):
    def addBinary(self, a, b):
        """
        :type a: str
        :type b: str
        :rtype: str
        """
        res = ""
        n , m = len(a) - 1, len(b) - 1
        carry = 0
        while n >= 0 or m >= 0:
            num1 = ord(a[n]) - ord('0') if n >= 0 else  0
            num2 = ord(b[m]) - ord('0') if m >= 0 else  0
            
            sum = num1 + num2 + carry
            num = sum % 2
            res = str(num) + res
            carry = sum / 2
            n-=1
            m-=1
        
        return "1" + res if carry == 1 else res