二叉树中和为某一值的路径

二叉树中和为某一值的路径

题目:

给你二叉树的根节点 root 和一个整数目标和 targetSum ，找出所有 从根节点到叶子节点 路径总和等于给定目标和的路径。

叶子节点 是指没有子节点的节点。

示例 1：
输入：root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
输出：[[5,4,11,2],[5,8,4,5]]

示例 2：
输入：root = [1,2,3], targetSum = 5
输出：[]
示例 3：

输入：root = [1,2], targetSum = 0
输出：[]

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {

    private List<List<Integer>> ans;

    public List<List<Integer>> pathSum(TreeNode root, int target) {
        ans = new ArrayList();
        dfs(root, target, new ArrayList<Integer>());
        return ans;
    }

    private void dfs(TreeNode node, int target, List<Integer> list) {
        if(node == null) {
            return ;
        }
        
        int sum = target - node.val;
        list.add(node.val);
        if(node.left == null && node.right == null && sum == 0) {
            ans.add(new ArrayList(list));
        }

        dfs(node.left, sum, list);
        dfs(node.right, sum, list);
        list.remove(list.size() - 1);
    }
}