2021-11-15 leetcode 113 找出所有 从根节点到叶子节点 路径总和等于给定目标和的路径

题目描述
解决思路：先序遍历，先将每一层的节点的值加入list，和减去这层节点的值，然后判断是否是叶子节点，判断是否和为0，若是则将list加入到lists中。进行左右子树遍历，最后将该层节点从list中删去，以便上溯到上一层。

解决代码：

/**
 * 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 {
    List<List<Integer>> lists = new LinkedList<>();
    public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
        if(root == null){
            return lists;
        }
        List<Integer> list = new LinkedList<>();
        dfs(root, list,targetSum);
        return lists;
    }
    public void dfs(TreeNode root, List list,int sum){
        if(root == null){
            return;
        }
        list.add(root.val);
        sum -= root.val;
        if(root.left == null && root.right == null && sum == 0){
            lists.add(new LinkedList<Integer>(list));
        }
        dfs(root.left, list, sum);
        dfs(root.right, list, sum);
        list.remove(list.size() - 1);
    }
}