二叉树中路径和为某整数的所有路径 lint code by python

目标值

目标值 = 5

1
/ \
2   4
/ \
2   3

[
[1, 2, 2],
[1, 4]
]

class Solution:
"""
@param: root: the root of binary tree
@param: target: An integer
@return: all valid paths
"""
list_val=[]
result=[]
def binaryTreePathSum(self, root, target):
# write your code here
self.pathSearcher(root,target)
return self.result
def pathSearcher(self,root,target):
if root==None: return
self.list_val.append(root.val)
if root.left==None and root.right==None:
"""
if using another codes, it just won't wort:
if root.val==target:
self.result.append(self.result.append(b))
"""
if root.val==target:
b=[]
for i in range(len(self.list_val)):
print(self.list_val[i])
b.append(self.list_val[i])
self.result.append(b)
else:
self.pathSearcher(root.left,target-root.val)
self.pathSearcher(root.right,target-root.val)
self.list_val.pop()