摘要：
class Solution: def addStrings(self, num1: str, num2: str) -> str: n = len(num1) m = len(num2) if n>m: for _ in range(n-m): num2 = '0'+num2 if n<m: fo 阅读全文
摘要：
# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self. 阅读全文
摘要：
# Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def 阅读全文
