[leetcode] @python 113. Path Sum II

题目链接

https://leetcode.com/problems/path-sum-ii/

题目原文

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

For example:
Given the below binary tree and sum = 22,

return

题目大意

上一题的扩展版，返回满足所有符合条件的路径

解题思路

使用dfs遍历

代码

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = Noneclass Solution(object):def pathSum(self, root, sum):""":type root: TreeNode:type sum: int:rtype: List[List[int]]"""def dfs(root, cursum, valuelist):if root.left == None and root.right == None:if cursum == sum:ans.append(valuelist)if root.left:dfs(root.left, cursum + root.left.val, valuelist + [root.left.val])if root.right:dfs(root.right, cursum + root.right.val, valuelist + [root.right.val])ans = []if root == None:return []dfs(root, root.val, [root.val])return ans

转载于:https://www.cnblogs.com/slurm/p/5272465.html

[leetcode] @python 113. Path Sum II相关推荐

LeetCode OJ 113. Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given su ...
[LeetCode]113.Path Sum II
[题目] Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the giv ...
leetcode 112. Path Sum, 113. Path Sum II | 112,113. 路径总和 I, II（Java）
题目 https://leetcode.com/problems/path-sum/ https://leetcode.com/problems/path-sum-ii/ 题解简单的遍历二叉树,不解 ...
LeetCode 113. Path Sum II
113. Path Sum II Given a binary tree and a sum, find all root-to-leaf paths where each path's sum eq ...
113. Path Sum II
/** 113. Path Sum II * 11.18 By Mingyang* 典型的backtracking,不过注意,这里的值可能是负数,所以不能用sum小于0来做任何判断* 1.长度标准:无 ...
Leetcode: 113. Path Sum II
题目 Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given ...
Leetcode: mimimum depth of tree, path sum, path sum II
思路: 简单搜索总结: dfs 框架 1. 需要打印路径. 在 dfs 函数中假如 vector 变量, 不用 & 修饰的话就不需要 undo 2. 不需要打印路径, 可设置全局变量 ans ...
【DP】LeetCode 64. Minimum Path Sum
LeetCode 64. Minimum Path Sum Solution1:标准的动态规划题目 class Solution { public:int minPathSum(vector<v ...
Path Sum II leetcode java
题目: Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the give ...
[Leetcode] Path Sum II路径和
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given su ...