LeetCode 67. 二进制求和

LeetCode 67. 二进制求和

class Solution:
    def addBinary(self, a: str, b: str) -> str:
        res = []
        m, n = len(a), len(b)

        i, j, t = len(a) - 1, len(b) - 1, 0
        while 0 <= i < m or 0 <= j < n:
            if 0 <= i < m:
                t += int(a[i])
                i -= 1
            if 0 <= j < n:
                t += int(b[j])
                j -= 1
            res.append(str(t % 2))
            t = t // 2
        if t:
            res.append("1")
        res.reverse()
        return "".join(res)