def hasPathSum(self, root, sum):
"""
1.判断条件:如果判断sum==0为true,会出现不是叶子节点的情况
2.判断条件是叶子节点的val == sum
"""
if not root:
return False
if not root.left and not root.right:
return root.val == sum
return self.hasPathSum(root.left, sum-root.val) or self.hasPathSum(root.right, sum-root.val)