想要输出最后路线的坐标,麻烦看看哪里出了问题
char[][] Maze = {{wall, pass, wall, wall, wall, wall, pass, pass, pass, wall, pass, pass, wall, pass, pass, pass},
{wall, wall, wall, pass, pass, wall, wall, wall, pass, wall, pass, pass, pass, pass, pass, pass},
{pass, wall, pass, wall, pass, wall, pass, pass, pass, pass, pass, pass, pass, pass, wall, pass},
{wall, pass, wall, wall, wall, pass, wall, pass, pass, pass, wall, pass, pass, pass, pass, pass},
{wall, pass, pass, wall, wall, pass, wall, wall, pass, pass, pass, pass, pass, pass, wall, pass},
{pass, wall, wall, wall, pass, wall, wall, pass, pass, pass, pass, wall, pass, pass, pass, pass},
{pass, wall, pass, wall, wall, pass, pass, pass, wall, wall, wall, wall, pass, pass, pass, pass},
{pass, pass, wall, pass, pass, wall, wall, pass, pass, pass, pass, pass, pass, pass, wall, pass},
{pass, wall, wall, pass, wall, wall, wall, wall, pass, wall, pass, pass, wall, pass, pass, pass},
{pass, wall, wall, wall, pass, pass, wall, wall, pass, pass, pass, pass, pass, wall, pass, pass},
{wall, wall, pass, pass, pass, wall, pass, pass, wall, wall, pass, wall, wall, pass, pass, pass},
{pass, pass, pass, pass, wall, wall, wall, wall, wall, pass, pass, wall, pass, pass, wall, pass},
{wall, wall, wall, wall, wall, pass, wall, wall, wall, wall, pass, pass, wall, pass, pass, wall},
{pass, wall, wall, pass, wall, pass, wall, pass, wall, wall, pass, wall, pass, pass, pass, pass},
{wall, wall, wall, pass, pass, wall, wall, wall, wall, pass, pass, pass, pass, pass, pass, pass},
{wall, wall, pass, wall, wall, pass, wall, pass, wall, pass, pass, wall, pass, wall, wall, pass}};
MazeWay(Maze, beginX, beginY, endX, endY);
}
public static void MazeWay(char[][] maze, int Bx, int By, int Ex, int Ey) {
char wall = '\u25a0';//代表墙
char pass = '\u25cb';//代表通道
if (Bx==Ex&&By==Ey) {//基准情形
System.out.println("(" + Ex + "," + Ey + ")");
} else {
if (maze[Bx][By] == pass) {//行走规则顺序是上,右,下,左
System.out.println("(" + Bx + "," + By + ")");
if (maze[Bx][By - 1] == pass) {
MazeWay(maze, Bx, By - 1, Ex, Ey);
} else if (maze[Bx + 1][By] == pass) {
MazeWay(maze, Bx + 1, By, Ex, Ey);
} else if (maze[Bx][By + 1] == pass) {
MazeWay(maze, Bx, By + 1, Ex, Ey);
} else if (maze[Bx - 1][By] == pass) {
MazeWay(maze, Bx - 1, By, Ex, Ey);
} else {
System.out.println("No way");
}
}
}
}
}
好像没有看见输出语句的样子