摘要：
自己还是没做出来。。 class Solution: def binaryTreePaths(self, root: TreeNode) -> List[str]: if not root: return [] res=[] def helper(root,temp): if not root.le 阅读全文
摘要：
同看懂做不出来。。。 class Solution: def pathSum(self, root: TreeNode, sum: int) -> List[List[int]]: res=[] if not root: return [] def helper(root,sum,tmp): if 阅读全文
摘要：
class Solution: def pathSum(self, root: TreeNode, sum: int) -> int: if not root: return 0 def dfs(node,sums): left=right=0 temp=[num+node.val for num 阅读全文
摘要：
class Solution: def longestUnivaluePath(self, root: TreeNode) -> int: self.ans=0 def arrow_length(node): if not node: return 0 left_length=arrow_lengt 阅读全文
摘要：
class Solution: def isUnivalTree(self, root: TreeNode) -> bool: if not root: return True else: a=root.val if root.left and root.left.val!=a: return Fa 阅读全文