剑指 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 ArrayList<>();
    LinkedList<Integer> path=new LinkedList<>();
    int target;
    public List<List<Integer>> pathSum(TreeNode root, int target) {
        this.target=target;
        recur(root);
        return res;
    }

    public void recur(TreeNode root){
        if(root==null) return;
        path.add(root.val);
        if(root.left==null&&root.right==null){
            int sum=0;
            for(int item:path){
                sum+=item;
            }
            if(sum==target) res.add(new ArrayList(path));注意！！！！
        }

        if(root.left!=null){
            recur(root.left);
        }
        if(root.right!=null){
            recur(root.right);
        }
        path.removeLast();
    }
}