老鼠走迷宫（Mouse）
问题说明：
老鼠走迷宫是循环求解的基本类型，我们在二维数组中用2来表示迷宫的墙壁，使用1来表示老鼠的行走路径，并用程序求出从入口到出口的距离。
问题解答：
实际上是使用回溯算法求解该问题，就是在上下左右四个方向试探，倘若有路则走一步，在新的位置继续在四个位置试探，并且对走过的路进行标记，倘若走到死胡同里，则退回上一步再来试探，以此类推，类似于图的深度优先算法，使用递归来实现。
结果：
Java代码：
| package com.allen; public class Mouse2 { private int startI, startJ; // 入口 private int endI, endJ; // 出口 private boolean success = false;
public static void main(String[] args) { int[][] maze = {{2, 2, 2, 2, 2, 2, 2}, {2, 0, 0, 0, 0, 0, 2}, {2, 0, 2, 0, 2, 0, 2}, {2, 0, 0, 2, 0, 2, 2}, {2, 2, 0, 2, 0, 2, 2}, {2, 0, 0, 0, 0, 0, 2}, {2, 2, 2, 2, 2, 2, 2}};
System.out.println("显示迷宫："); for(int i = 0; i < maze.length; i++) { for(int j = 0; j < maze[0].length; j++) if(maze[i][j] == 2) System.out.print("█"); else System.out.print(" "); System.out.println(); } Mouse2 mouse = new Mouse2(); mouse.setStart(1, 1); mouse.setEnd(5, 5);
if(!mouse.go2(maze)) { System.out.println("\n没有找到出口！"); } else { System.out.println("\n找到出口！"); for(int i = 0; i < maze.length; i++) { for(int j = 0; j < maze[0].length; j++) { if(maze[i][j] == 2) System.out.print("█"); else if(maze[i][j] == 1) System.out.print("m"); else System.out.print(" "); } System.out.println(); } } }
public void setStart(int i, int j) { this.startI = i; this.startJ = j; }
public void setEnd(int i, int j) { this.endI = i; this.endJ = j; }
public boolean go2(int[][] maze) { return visit(maze, startI, startJ); }
private boolean visit(int[][] maze, int i, int j) { maze[i][j] = 1; if(i == endI && j == endJ) success = true; if(!success && maze[i][j+1] == 0) visit(maze, i, j+1); if(!success && maze[i+1][j] == 0) visit(maze, i+1, j); if(!success && maze[i][j-1] == 0) visit(maze, i, j-1); if(!success && maze[i-1][j] == 0) visit(maze, i-1, j); if(!success) maze[i][j] = 0;
return success; } } |
由于迷宫的设计，老鼠从迷宫的入口到出口的路径可能不只一条，下面我们显示所有路径。
Java代码：
| package com.allen; public class Mouse { private int startI, startJ; // 入口 private int endI, endJ; // 出口
public static void main(String[] args) { int maze[][] = {{2, 2, 2, 2, 2, 2, 2, 2, 2}, {2, 0, 0, 0, 0, 0, 0, 0, 2}, {2, 0, 2, 2, 0, 2, 2, 0, 2}, {2, 0, 2, 0, 0, 2, 0, 0, 2}, {2, 0, 2, 0, 2, 0, 2, 0, 2}, {2, 0, 0, 0, 0, 0, 2, 0, 2}, {2, 2, 0, 2, 2, 0, 2, 2, 2}, {2, 0, 0, 0, 0, 0, 0, 0, 2}, {2, 2, 2, 2, 2, 2, 2, 2, 2}};
System.out.println("显示迷宫："); for(int i = 0; i < maze.length; i++) { for(int j = 0; j < maze[0].length; j++) if(maze[i][j] == 2) System.out.print("█"); else System.out.print(" "); System.out.println(); } Mouse mouse = new Mouse(); mouse.setStart(1, 1); mouse.setEnd(7, 7);
mouse.go(maze); }
public void setStart(int i, int j) { this.startI = i; this.startJ = j; }
public void setEnd(int i, int j) { this.endI = i; this.endJ = j; }
public void go(int[][] maze) { visit(maze, startI, startJ); }
private void visit(int[][] maze, int i, int j) { maze[i][j] = 1; if(i == endI && j == endJ) { System.out.println("\n找到出口！"); for(int m = 0; m < maze.length; m++) { for(int n = 0; n < maze[0].length; n++) { if(maze[m][n] == 2) System.out.print("█"); else if(maze[m][n] == 1) System.out.print("m"); else System.out.print(" "); } System.out.println(); } } if(maze[i][j+1] == 0) visit(maze, i, j+1); if(maze[i+1][j] == 0) visit(maze, i+1, j); if(maze[i][j-1] == 0) visit(maze, i, j-1); if(maze[i-1][j] == 0) visit(maze, i-1, j);
maze[i][j] = 0; } } |
344
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
