打印树的和的路径

题目

给定一个二叉树，找到从根节点到叶子节点的和与给定目标相等的路径

思路

从根节点开始，遍历每一条路径，每走过一个节点，就把目标值减去这个节点的值，当最后一个节点没有左右孩子且这个节点的值等于剩余的目标值，就返回这个路径，用一个局部list存当前路径。

  def sum(self,target):
    return self.sum_helper(self.root,target)

  def sum_helper(self,node,target):
    if node is None:
      return False
    if node._left is None and node._right is None and node._item == target:
    #if node._item == target:
      return True
    target = target - node._item

    return self.sum_helper(node._left,target) or self.sum_helper(node._right,target)
  

  def sum_road(self,target):
    return self.sum_target_helper(self.root,target)
  def sum_target_helper(self,node,target):
    if node is None:
      return []
    res = []
    self.dfs(node,target,[],res)
    return res
  def dfs(self,node,target,ls,res):
    if node._left is None and node._right is None and node._item == target:
      ls.append(node._item)
      res.append(ls)
    if node._left:
      self.dfs(node._left,target-node._item,ls+[node._item],res)
    if node._right:
      self.dfs(node._right,target-node._item,ls+[node._item],res)

def sum(self,target):
    return self.sum_helper(self.root,target)

  def sum_helper(self,node,target):
    if node is None:
      return False
    #if node._left is None and node._right is None and node._item == target:
    if node._item == target:
      return True
    target = target - node._item

    return self.sum_helper(node._left,target) or self.sum_helper(node._right,target)
  

  def sum_road(self,target):
    return self.sum_road_all(self.root,target)
    #return self.sum_target_helper(self.root,target)
  def sum_road_all(self,node,target):
    if node is not None:
      return self.sum_target_helper(node,target)+self.sum_target_helper(node._left,target)+self.sum_target_helper(node._right,target)
  def sum_target_helper(self,node,target):
    if node is None:
      return []
    res = []
    self.dfs(node,target,[],res)
    return res
  def dfs(self,node,target,ls,res):
   # if node._left is None and node._right is None and node._item == target:
    if node._item == target:
      ls.append(node._item)
      res.append(ls)
    if node._left:
      self.dfs(node._left,target-node._item,ls+[node._item],res)
    if node._right:
      self.dfs(node._right,target-node._item,ls+[node._item],res)