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] ]
Use recursion. Remember to remove the last element of a item whenever necessary.
/**
* 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>> res = new ArrayList<ArrayList<Integer>>();
if (root == null) {
return res;
}
ArrayList<Integer> item = new ArrayList<Integer>();
helper(res, item, root, sum);
return res;
}
private void helper(ArrayList<ArrayList<Integer>> res, ArrayList<Integer> item, TreeNode root, int sum) {
if (root == null) {
return;
}
if (root.left == null && root.right == null && root.val == sum) {
item.add(root.val);
res.add(new ArrayList<Integer>(item));
item.remove(item.size() - 1);
}
item.add(root.val);
helper(res, item, root.left, sum - root.val);
helper(res, item, root.right, sum - root.val);
item.remove(item.size() - 1);
}
}