# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def pathSum(self, root, sum):
"""
:type root: TreeNode
:type sum: int
:rtype: int
"""
self.num=0
if(root==None):
return 0
self.helper(root,sum)
return self.num
def helper(self,root,sum):
if(root==None):
return
self.dfs(root,sum)
self.helper(root.left,sum)
self.helper(root.right,sum)
def dfs(self,root,target):
if(root==None):
return
if(root.val==target):
self.num+=1
self.dfs(root.left,target-root.val)
self.dfs(root.right,target-root.val)
错误示例:在pathSum中递归调用,每次self.num都初始化为0,这是错误的原因
class Solution(object):
def pathSum(self, root, sum):
"""
:type root: TreeNode
:type sum: int
:rtype: int
"""
self.num=0
if(root==None):
return 0
self.dfs(root,sum)
self.pathSum(root.left,sum)
self.pathSum(root.right,sum)
return self.num
def dfs(self,root,target):
if(root==None):
return
if(root.val==target):
self.num+=1
return
self.dfs(root.left,target-root.val)
self.dfs(root.right,target-root.val)
``