JZ34 二叉树中和为某一值的路径(二) 方法1:回溯-递减 ArrayList<ArrayList<Integer>> res = new ArrayList<>(); public ArrayList<ArrayList<Integer>> FindPath(TreeNode root, int targetSum) { dfs(root, targetSum, new ArrayList<>()); return res; ...