【剑指offer】二叉树中和为某一值的路径

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

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

public ArrayList<ArrayList<Integer>> FindPath(TreeNode root, int target) {
    ArrayList<ArrayList<Integer>> paths = new ArrayList<>();
    ArrayList<Integer> path = new ArrayList<>();

    FindPath(root, target, 0, path, paths);

    return paths;
}

private void FindPath(TreeNode root, int target, int sum, ArrayList<Integer> path, ArrayList<ArrayList<Integer>> paths) {
    if (root == null)
        return;

    int currentSum = sum + root.val;
    path.add(root.val);

    if (currentSum == target && root.left == null && root.right == null)
        paths.add(new ArrayList(path));

    FindPath(root.left, target, currentSum, path, paths);
    FindPath(root.right, target, currentSum, path, paths);

    path.remove(path.size() - 1);
}