Description:
Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.
Note:
- A leaf is a node with no children.
Example:
Given the below binary tree and sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
Return:
[
[5,4,11,2],
[5,8,4,5]
]
题意:给定一颗二叉树,找出所有从根节点到叶子节点满足其上所有节点和为指定值的路径;
解法:这道题和Path Sum很相似,所不同的是,我们需要找到所有的路径并且记录下这些路径,但是方法还是一样的;对于一颗二叉树T,找一条从根节点到叶子节点的路径满足和为sum,即递归的找根节点的左右子树中是否有一条从左右节点到根节点的路径满足节点值得和为sum-T.val;
Java
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<List<Integer>> pathSum(TreeNode root, int sum) {
List<List<Integer>> result = new ArrayList<>();
if (root == null) return result;
getAllPath(root, result, new ArrayList<>(), sum);
return result;
}
private void getAllPath(TreeNode root, List<List<Integer>> result,
List<Integer> list, int sum) {
if (root == null) return;
if (root.left == null && root.right == null) {
if (sum == root.val) {
list.add(root.val);
result.add(new ArrayList<>(list));
list.remove(list.size() - 1);
}
return;
}
list.add(root.val);
getAllPath(root.left, result, list, sum - root.val);
getAllPath(root.right, result, list, sum - root.val);
list.remove(list.size() - 1);
}
}