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”

bin()内置函数

先将二进制字符串通过python中的int()函数转化为2进制，进行求和得到十进制，再将十进制通过python中的bin()函数转化为二进制。

class Solution(object):
    def addBinary(self, a, b):
        """
        :type a: str
        :type b: str
        :rtype: str
        """
        return bin(int(a,2)+int(b,2))[2:]

进位相加

从后向前逐位计算，满2进1.

class Solution(object):
    def addBinary(self, a, b):
        """
        :type a: str
        :type b: str
        :rtype: str
        """
        i,j = len(a)-1,len(b)-1
        temp = 0
        res = ""
        while i>=0 or j>=0 or temp ==1:
            temp += int(a[i]) if i >=0 else 0
            temp += int(b[j]) if j >=0 else 0
            t = temp%2
            res = str(t) + res
            i-= 1
            j-= 1
            temp = int(temp/2)
        return res

递归

分三种情况直接递归。

class Solution(object):
    def addBinary(self, a, b):
        """
        :type a: str
        :type b: str
        :rtype: str
        """
        if not a or not b:
            return a if a else b
        if a[-1] == "1" and b[-1] =="1":
            return self.addBinary(self.addBinary(a[:-1],b[:-1]),"1")+"0"
        elif a[-1] == "0" and b[-1] == "0":
            return self.addBinary(a[:-1],b[:-1]) + "0"
        else:
            return self.addBinary(a[:-1],b[:-1]) + "1"