67.二进制求和(通过)Python

二进制求和最蠢写法(没有用bin()和int())后边附上使用int和bin版本

class Solution:
    def addBinary(self, a, b):
        """
        :type a: str
        :type b: str
        :rtype: str
        """
        a = list(map(int,list(a)))
        b = list(map(int,list(b)))
        tmp = 0
        res = ''
        while a and b:

            val = a.pop() + b.pop() + tmp
            if val == 3:
                res = str('1') + res
                tmp = 1
            elif val == 2:
                res = str('0') + res
                tmp = 1
            elif val == 1:
                res = str('1') + res
                tmp = 0
            else:
                res = str('0') + res
                tmp = 0
        if len(a) == 0:
            while b:
                cc = b.pop() + tmp
                if cc == 2:
                    res = str('0') + res
                    tmp = 1
                elif cc == 1:
                    res = str('1') + res
                    tmp = 0
                    break
                else:
                    res = str('0') + res
                    tmp = 0
                    break
            b = map(str,b)
            preres = "".join(b)
            
        else:
            while a:
                cc = a.pop() + tmp
                if cc == 2:
                    res = str('0') + res
                    tmp = 1
                elif cc == 1:
                    res = str('1') + res
                    tmp = 0
                    break
                else:
                    res = str('0') + res
                    tmp = 0
                    break
                                
                    
            a = map(str,a)
            preres = "".join(a)
        if tmp == 1:
            result = str(tmp) + preres + res
        else:
            result = preres + res
        return result
        
class Solution:
    def addBinary(self, a, b):
        """
        :type a: str
        :type b: str
        :rtype: str
        """
        a, b = int(a, 2), int(b, 2)
        return bin(a + b)[2:]
  
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值