如何使用递归跟踪(Java)找到特定迷宫的解？

public class MazeSolver {
    // 定义迷宫的数据结构
    private static char[][] maze = {
        {'#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#'},
        {'#', 'S', '#', ' ', ' ', ' ', '#', ' ', '#', ' ', '#'},
        {'#', ' ', '#', '#', ' ', '#', '#', ' ', ' ', ' ', '#'},
        {'#', ' ', ' ', ' ', ' ', ' ', '#', ' ', '#', ' ', '#'},
        {'#', '#', '#', '#', '#', '#', '#', ' ', '#', ' ', '#'},
        {'#', ' ', ' ', ' ', '#', ' ', ' ', ' ', '#', ' ', '#'},
        {'#', '#', '#', ' ', '#', ' ', '#', '#', '#', ' ', '#'},
        {'#', ' ', ' ', ' ', '#', ' ', ' ', ' ', '#', ' ', '#'},
        {'#', ' ', '#', '#', '#', '#', '#', '#', '#', ' ', '#'},
        {'#', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', 'E', '#'},
        {'#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#'}
    };

    public static void main(String[] args) {
        // 调用递归函数
        ArrayList<Point> path = solveMaze(new Point(1, 1), new ArrayList<Point>());

        // 打印解的路径
        if (path != null) {
            System.out.println("迷宫的解路径：");
            for (Point point : path) {
                System.out.println("(" + point.x + ", " + point.y + ")");
            }
        } else {
            System.out.println("无解");
        }
    }

    // 递归函数
    private static ArrayList<Point> solveMaze(Point current, ArrayList<Point> path) {
        // 终止条件
        if (maze[current.x][current.y] == 'E') {
            return path;
        }

        // 边界检查
        if (maze[current.x][current.y] == '#' || maze[current.x][current.y] == 'V') {
            return null;
        }

        // 标记当前位置
        maze[current.x][current.y] = 'V';

        // 递归调用四个方向
        ArrayList<Point> up = solveMaze(new Point(current.x - 1, current.y), new ArrayList<Point>(path));
        ArrayList<Point> down = solveMaze(new Point(current.x + 1, current.y), new ArrayList<Point>(path));
        ArrayList<Point> left = solveMaze(new Point(current.x, current.y - 1), new ArrayList<Point>(path));
        ArrayList<Point> right = solveMaze(new Point(current.x, current.y + 1), new ArrayList<Point>(path));

        // 合并路径
        if (up != null) {
            path.add(current);
            return up;
        }
        if (down != null) {
            path.add(current);
            return down;
        }
        if (left != null) {
            path.add(current);
            return left;
        }
        if (right != null) {
            path.add(current);
            return right;
        }

        // 取消标记
        maze[current.x][current.y] = ' ';

        return null;
    }
}