给定一个数和一棵树,求能否有一条路径上所有叶子结点数值加起来等于给定的数
递归
class Solution(object):
def hasPathSum(self, root, sum):
"""
:type root: TreeNode
:type sum: int
:rtype: bool
"""
if root == None:
return False
if root.left == None and root.right == None:
return sum == root.val
return self.hasPathSum(root.left, sum - root.val) or self.hasPathSum(root.right, sum - root.val)
self.hasPathSum(root.left, sum - root.val) or self.hasPathSum(root.right, sum - root.val)