【2021秋冬】【剑指offer】34. 二叉树中和为某一值的路径

思路是对的，但是路径在递归里的循环和存储需要注意

/**
 * 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>> res = new LinkedList<>();
    LinkedList<Integer> con = new LinkedList<>();
    public List<List<Integer>> pathSum(TreeNode root, int target) {
          
        dfs(root,target);
        return res;

    }

    void dfs(TreeNode root, int target){
        if(root == null) return;
        con.add(root.val);
        if(target - root.val == 0 && root.left == null && root.right == null){         
            res.add(new LinkedList(con));           
        }        
        
        dfs(root.left,target-root.val);
        dfs(root.right,target-root.val); 
        con.removeLast();
    }

}