剑指Offer34,二叉树中和为某一值的路径

Posted 2021-11-23 小布丁value

https://leetcode-cn.com/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/solution/mian-shi-ti-34-er-cha-shu-zhong-he-wei-mou-yi-zh-5/

public class Day10271 {
    LinkedList<List<Integer>> res= new LinkedList<>();
    LinkedList<Integer> path= new LinkedList<>();
    public List<List<Integer>> pathSum(TreeNode root, int target){
        recur(root,target);
        return  res;
    }
    public void recur(TreeNode root,int tar){
        if(root==null) return;
        path.add(root.val);
        tar-=root.val;
        if(tar==0&&root.left==null&&root.right==null){
            res.add(new LinkedList(path));
        }
        recur(root.left,tar);
        recur(root.right,tar);
        path.removeLast();
    }
}