方法一
class Solution(object):
def pathSum(self, root, sum):
"""
:type root: TreeNode
:type sum: int
:rtype: List[List[int]]
"""
ans = []
if not root:
return ans
self.dfs(root, sum, ans, [])
return ans
def dfs(self, root, target, ans, temp):
if root:
temp.append(root.val)
target -= root.val
left = self.dfs(root.left, target, ans, temp)
right = self.dfs(root.right, target, ans, temp)
if not left and not right and target == 0:
ans.append(temp + [])
temp.pop()
return True
方法二
class Solution(object):
def pathSum(self, root, sumt):
"""
:type root: TreeNode
:type sum: int
:rtype: List[List[int]]
"""
ans = []
if not root:
return ans
stack = [(root, [root.val])]
while stack:
node, temp = stack.pop()
if not node.left and not node.right and sum(temp) == sumt:
ans.append(temp)
if node.left:
stack.append((node.left, temp + [node.left.val]))
if node.right:
stack.append((node.right, temp + [node.right.val]))
return ans[::-1]