/*** @Author: Yeman* @Date: 2021-10-28-22:52* @Description:*/ public class Labyrinth {public static void main(String[] args) {//七行八列的迷宮地圖int[][] map = new int[8][7];//設(shè)置墻for (int i = 0; i < 7; i++) {map[0][i] = 1;map[7][i] = 1;}for (int i = 0; i < 8; i++) {map[i][0] = 1;map[i][6] = 1;}map[2][1] = 1;map[2][2] = 1;//查看原地圖System.out.println("原地圖：");for (int i = 0; i < 8; i++) {for (int j = 0; j < 7; j++) {System.out.print(map[i][j] + " ");}System.out.println();}//走迷宮setWay(map, 1, 1);//查看走后的迷宮System.out.println("走過(guò)的：");for (int i = 0; i < 8; i++) {for (int j = 0; j < 7; j++) {System.out.print(map[i][j] + " ");}System.out.println();}}//使用遞歸尋找//約定0為還沒(méi)走過(guò)，1為墻，2為通路，3為行不通的public static boolean setWay(int[][] map, int i, int j){if (map[6][5] == 2){return true;}else {if (map[i][j] == 0){map[i][j] = 2;//策略：下右上左if (setWay(map,i+1,j)){return true;}else if (setWay(map,i,j+1)){return true;}else if (setWay(map,i-1,j)){return true;}else if (setWay(map,i,j-1)){return true;}else {map[i][j] = 3;return false;}}else {return false;}}} }

創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎(jiǎng)勵(lì)來(lái)咯，堅(jiān)持創(chuàng)作打卡瓜分現(xiàn)金大獎(jiǎng)

總結(jié)

以上是生活随笔為你收集整理的数据结构，Java实现递归回溯，寻找出迷宫路线，解决迷宫问题的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。