67. Add Binary

最新推荐文章于 2020-05-11 20:42:15 发布

原创最新推荐文章于 2020-05-11 20:42:15 发布 · 403 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

31 篇文章

订阅专栏

本文介绍了如何实现两个二进制字符串的相加操作，并提供了两种不同的Python实现方法：一种是迭代方法，通过逐位相加并处理进位；另一种是递归方法，通过不断去除最后一位并递归调用直至字符串为空。

67. Add Binary

Leetcode link for this question

Discription:

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

For example,
a = “11”
b = “1”
Return “100”.

Code 1:

class Solution(object):
    def addBinary(self, a, b):
        """
        :type a: str
        :type b: str
        :rtype: str
        """
        la =len(a)
        lb=len(b)
        if la<lb:
            return self.addBinary(b,a)
        b='0'*(la-lb)+b
        carry=0
        a=list(a)
        for i in range(la-1,-1,-1):
            sum=int(a[i])+int(b[i])+carry
            if sum==1 or sum==0:
                a[i]=str(sum)
                carry=0
            else:
                a[i]=str(sum-2)
                carry=1
        if carry==1:
            return '1'+''.join(a)
        return ''.join(a)

Submission Result:

Status: Accepted
Runtime: 80 ms
Ranking: beats 22.46%

Code 2（recursive function）:

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