摘要:
class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = Nonea = TreeNode(0)b = TreeNode(0)c = TreeNode(0)d = TreeNode(0)a.le 阅读全文
摘要:
class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None# 这道也是简单题,也是用深搜的办法来做的。# 遍历每一个节点,然后如果这个节点两个树都有的话就加到第一个树上边。# 如果第二个 阅读全文