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]
]
思路
一般看到求所有List 都先想到backtracking
本题的思路和112 path sum 差不太多
都是每次用sum减去当前值
具体再注释中写下
/**
* 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>> res = new ArrayList<>();
if(root == null){
return res;
}
List<Integer> list = new ArrayList<>();
backtrack(res,list,sum,root);
return res;
}
public void backtrack( List<List<Integer>> res,List<Integer> list, int sum, TreeNode root){
//停止条件
if(root == null){
return;
}
if(sum -root.val == 0 && root.left == null&& root.right == null){
list.add(root.val);
res.add(new ArrayList<>(list));
list.remove(list.size() - 1);
return;
}
//如果不符合停止条件,开始递归,每次加入根结点的值,并以其左子树为根节点继续向下递归,如果一直到最后一个节点,如果最后一个节点不符合停止要求 则删除最后一个, 换成右子树,如果右子树也不符合,则再向上退一个高度
list.add(root.val);
backtrack(res,list,sum- root.val,root.left);
backtrack(res,list,sum - root.val,root.right);
list.remove(list.size() -1);
}
}