[Lintcode] #376 二叉树的路径和

给定一个二叉树，找出所有路径中各节点相加总和等于给定 目标值 的路径。

一个有效的路径，指的是从根节点到叶节点的路径。

您在真实的面试中是否遇到过这个题？ 

Yes

样例

给定一个二叉树，和 目标值 = 5:

     1
    / \
   2   4
  / \
 2   3

返回：

[
  [1, 2, 2],
  [1, 4]
]

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */


public class Solution {
    /*
     * @param root: the root of binary tree
     * @param target: An integer
     * @return: all valid paths
     */
    public List<List<Integer>> binaryTreePathSum(TreeNode root, int target) {
        // write your code here
        List<List<Integer>> data = new ArrayList<>();
		helper(root, new ArrayList<Integer>(), data, 0, target);
		return data;
    }
    
    public void helper(TreeNode root, List<Integer> cur, List<List<Integer>> data, int sum, int target) {
		if (root == null)
			return;
		sum += root.val;
		cur.add(root.val);
		if (sum == target && root.left == null && root.right == null)
			data.add(cur);
		helper(root.left, new ArrayList<>(cur), data, sum, target);
		helper(root.right, new ArrayList<>(cur), data, sum, target);
	}
}