【Python】 3.6

[Trp_Cys]

题目: 66. 加一 - 力扣（Leetcode）

class Solution:
    def plusOne(self, digits: List[int]) -> List[int]:
        digits[-1] += 1
        length = len(digits)
        for i in range(1,length + 1):
            k = -i
            if digits[k] == 10:
                if k == -length:
                    digits[k] = 0
                    res = [1] + digits
                else:
                    res = digits
                    res[k] = 0
                    res[k - 1] += 1
            else:
                res = digits
        return res

 

题目: 67. 二进制求和 - 力扣（Leetcode）

class Solution:
    def addBinary(self, a: str, b: str) -> str:
        bin_a = eval(a)
        bin_b = eval(b)
        a = 0
        b = 0
        i = 0
        j = 0
        while bin_a > 0:
            a += (bin_a % 10) * pow(2, i)
            i += 1
            bin_a //= 10

        while bin_b > 0:
            b += (bin_b % 10) * pow(2, j)
            j += 1
            bin_b //= 10

        c = a + b
        return bin(c)[2:]