java迷宫问题

最新推荐文章于 2024-07-30 20:50:32 发布

小曹不是码农

最新推荐文章于 2024-07-30 20:50:32 发布

阅读量377

点赞数 2

文章标签： java 算法开发语言

本文链接：https://blog.csdn.net/2303_77002079/article/details/139640700

版权

public class cc {
        public static void main(String[] args) {
            int[][] map = new int[8][7];
            // Construct the maze
            for (int i = 0; i < map.length; i++) {
                map[i][0] = 1;
                map[i][6] = 1;
            }
            for (int j = 0; j < map[0].length; j++) { // Corrected loop boundary
                map[0][j] = 1;
                map[7][j] = 1;
            }
            map[3][1] = 1;
            map[3][2] = 1;
            // Print the maze
            System.out.println("======= 打印迷宫 =======");
            for (int i = 0; i < map.length; i++) {
                for (int j = 0; j < map[i].length; j++) {
                    System.out.print(map[i][j] + "   ");
                }
                System.out.println();
            }
            // Instantiate the maze
            T t1 = new T();
            t1.findWay(map, 1, 1);
            // Print the maze after traversing
            System.out.println("======= 穿越后迷宫 =======");
            for (int i = 0; i < map.length; i++) {
                for (int j = 0; j < map[i].length; j++) {
                    System.out.print(map[i][j] + "   ");
                }
                System.out.println();
            }
        }
    }

    class T {
        // 0: path, 1: obstacle, 2: path taken, 3: dead end
        public boolean findWay(int[][] map, int i, int j) {
            if (map[6][5] == 2) { // Reached the exit
                return true;
            } else {
                if (map[i][j] == 0) {
                    map[i][j] = 2; // Mark the position as taken
                    if (findWay(map, i + 1, j)) {
                        return true;
                    } else if (findWay(map, i, j + 1)) {
                        return true;
                    } else if (findWay(map, i - 1, j)) {
                        return true;
                    } else if (findWay(map, i, j - 1)) {
                        return true;
                    } else {
                        map[i][j] = 3;
                        return false;
                    }
                }
                return false;
            }
        }
    }