- 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 root.val==sum
- else:
- return self.hasPathSum(root.left,sum-root.val) or self.hasPathSum(root.right,sum-root.val)
思想就是深度遍历二叉树,判断是否路径加和等于sum
注意:1、调用函数需要添加self 2、结点的值是root.val不是root.value
参考帖子:
https://blog.csdn.net/lilong_dream/article/details/22875143