leetcode刷题python之二进制求和

最新推荐文章于 2024-04-21 15:42:48 发布

leileii

最新推荐文章于 2024-04-21 15:42:48 发布

阅读量102

点赞数

分类专栏： leetcode_python

本文链接：https://blog.csdn.net/leileii/article/details/102808752

版权

leetcode_python 专栏收录该内容

106 篇文章 0 订阅

订阅专栏

思路：先补齐，再相加，有进位则flag变为1

class Solution:
    def addBinary(self, a: str, b: str) -> str:
        if len(a) < len(b):
            a, b = b, a 
        b = "0" * (len(a) - len(b)) + b
        a = list(a)
        b = list(b)
        flag = [0] * (len(a) + 1)
        res = ["0"] * len(a)
        for i in range(len(b) - 1, -1, -1):
            num = int(a[i]) + int(b[i]) + flag[i]
            if num == 0:
                pass
            elif num == 1:
                res[i] = "1"
            elif num == 2:
                res[i] = "0"
                if i > 0:
                    flag[i - 1] = 1
                else:
                    return "1" + str("".join(res))
            else:
                res[i] = "1"
                if i > 0:
                    flag[i - 1] = 1
                else:
                    return "1" + str("".join(res))
        return "".join(res)