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

https://www.nowcoder.com/practice/b736e784e3e34731af99065031301bca?tpId=13&tags=&title=&difficulty=0&judgeStatus=0&rp=1

描述

输入一颗二叉树的根节点和一个整数，按字典序打印出二叉树中结点值的和为输入整数的所有路径。路径定义为从树的根结点开始往下一直到叶结点所经过的结点形成一条路径。

示例1

输入：

{10,5,12,4,7},22

复制返回值：

[[10,5,7],[10,12]]

复制

示例2

输入：

{10,5,12,4,7},15

复制返回值：

[]

 

public class Jz24_FindPath {

    private ArrayList<ArrayList<Integer>> paths = new ArrayList<>();
    private ArrayList<Integer> path = new ArrayList<>();

    public ArrayList<ArrayList<Integer>> FindPath2(TreeNode root, int target) {
        if (null == root || target < 0) {
            return paths;
        }
        path.add(root.val);
        target -= root.val;
        if (target == 0 && root.left == null && root.right == null) {
            paths.add(new ArrayList<>(path));
        }
        FindPath2(root.left, target);
        FindPath2(root.right, target);
        path.remove(path.size() - 1);
        return paths;
    }

    public ArrayList<ArrayList<Integer>> FindPath(TreeNode root, int target) {
        if (null == root || 0 == target) {
            return paths;
        }
        solve(root, new ArrayList<Integer>(), 0, target);
        return paths;
    }

    public void solve(TreeNode cur, ArrayList<Integer> path, int curSum, int target) {
        path.add(cur.val);
        curSum += cur.val;
        if (null == cur.left && null == cur.right) {
            if (curSum == target) {
                ArrayList<Integer> ans = new ArrayList<>(path);
                paths.add(ans);
                path.remove(path.size() - 1);
                return;
            }
        }
        if (curSum > target) {
            path.remove(path.size() - 1);
            return;
        }
        if (null != cur.left) {
            solve(cur.left, path, curSum, target);
        }
        if (null != cur.right) {
            solve(cur.right, path, curSum, target);
        }
        path.remove(path.size() - 1);
    }


    public class TreeNode {
        int val = 0;
        TreeNode left = null;
        TreeNode right = null;

        public TreeNode(int val) {
            this.val = val;

        }
    }

}