摘要：
class Solution: def plusOne(self, digits: List[int]) -> List[int]: for i in reversed(range(len(digits))): if digits[i] == 9: digits[i] = 0 else: digits[i] += 1 return digits digits[0] = 1 digits.appen 阅读全文
摘要：
class Solution: def mySqrt(self, x: int) -> int: if x x / mid: right = mid - 1 else: left = mid + 1 return left - 1 阅读全文
摘要：
class Solution: def addBinary(self, a: str, b: str) -> str: result, carry, val = '', 0, 0 for i in range(max(len(a), len(b))): val = carry if i < len(a): val += int(a[-(i+1)]) if i < len(b): val += in 阅读全文