Question:
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
,
5 / \ 4 8 / / \ 11 13 4 / \ / \ 7 2 5 1
return
[ [5,4,11,2], [5,8,4,5] ]
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public ArrayList<ArrayList<Integer>> pathSum(TreeNode root, int sum) {
ArrayList<ArrayList<Integer>> result = new ArrayList<>();
ArrayList<Integer> current = new ArrayList<Integer>();
pathSum(root,sum,current,result);
return result;
}
private void pathSum(TreeNode root, int sum, ArrayList<Integer> current,
ArrayList<ArrayList<Integer>> result) {
if (root==null) {
return;
}
current.add(root.val);
if (root.left==null&&root.right==null) {
if(sum==root.val){
ArrayList<Integer> tmp = new ArrayList<Integer>(current);
result.add(tmp);
}
}
pathSum(root.left,sum-root.val,current,result);
pathSum(root.right,sum-root.val,current,result);
if (current.size()>0) {
current.remove(current.size()-1);
}
return;
}
}