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] ]
找出所有跟到叶的路径结果值为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;
}
getRes(root,0,sum,res,new ArrayList<>());
return res;
}
public void getRes(TreeNode root,int now,int sum,List<List<Integer>> res,List<Integer> tmp) {
tmp.add(root.val);
now = root.val+now;
if(root.left == null && root.right == null) {
if(now == sum) {
res.add(new ArrayList<>(tmp));
}
}else {
if(root.left!=null) getRes(root.left,now,sum,res,tmp);
if(root.right!=null) getRes(root.right,now,sum,res,tmp);
}
tmp.remove(tmp.size()-1);
}
}