java学习p222

最新推荐文章于 2024-10-20 17:09:42 发布

所沢

最新推荐文章于 2024-10-20 17:09:42 发布

阅读量60

点赞数

文章标签： java 开发语言后端

本文链接：https://blog.csdn.net/weixin_54597766/article/details/121141622

版权

public class a1 {
    public static void main(String[] args) {
        int[][] map = new int[8][7];
        for (int i = 0; i < map[i].length; i++) {
            map[0][i] = 1;
            map[7][i] = 1;
        }
        for (int i = 0; i < map.length; i++) {
            map[i][0] = 1;
            map[i][6] = 1;
        }
        map[3][1] = 1;
        map[3][2] = 1;
        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();
        }
        MiGong m = new MiGong();
        m.findWay1(map, 1, 1);
        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 MiGong {
    public boolean findWay1(int[][] map, int i, int j) {
        if (map[6][5] == 2) {
            return true;
        }
        if (map[i][j] == 0) {
            map[i][j] = 2;
            if (findWay1(map, i + 1, j)) {//行走策略:下 右 上 左
                return true;
            }
            else if (findWay1(map, i, j + 1)) {
                return true;
            }
            else if (findWay1(map, i - 1, j)) {
                return true;
            }
            else if (findWay1(map, i, j - 1)) {
                return true;
            }
            else {
                map[i][j] = 3;
                return false;
            }
        }
        else {//map[i][j] == 1 or 2 or 3(1:障碍物, 2:该位置已走过了, 3:该位置不通)
            return false;
        }
    }
}

import java.util.Scanner;
public class a1 {
    public static void main(String[] args) {
        int[][] map = new int[8][7];
        for (int i = 0; i < map[i].length; i++) {
            map[0][i] = 1;
            map[7][i] = 1;
        }
        for (int i = 0; i < map.length; i++) {
            map[i][0] = 1;
            map[i][6] = 1;
        }
        map[3][1] = 1;
        map[3][2] = 1;
        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();
        }
        Scanner myScanner = new Scanner(System.in);
        System.out.println("请选择行走策略 1.下 右 上 左 2.上 右 下 左");
        int choose = myScanner.nextInt();
        MiGong m = new MiGong();
        switch (choose) {
            case 1:
                m.findWay1(map, 1, 1);
                break;
            case 2:
                m.findWay2(map, 1, 1);
                break;
            default:
                System.out.println("输入错误");
                return;
        }
        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 MiGong {
    public boolean findWay1(int[][] map, int i, int j) {
        if (map[6][5] == 2) {
            return true;
        }
        if (map[i][j] == 0) {
            map[i][j] = 2;
            if (findWay1(map, i + 1, j)) {//行走策略:下 右 上 左
                return true;
            }
            else if (findWay1(map, i, j + 1)) {
                return true;
            }
            else if (findWay1(map, i - 1, j)) {
                return true;
            }
            else if (findWay1(map, i, j - 1)) {
                return true;
            }
            else {
                map[i][j] = 3;
                return false;
            }
        }
        else {//map[i][j] == 1 or 2 or 3(1:障碍物, 2:该位置已走过了, 3:该位置不通)
            return false;
        }
    }
    public boolean findWay2(int[][] map, int i, int j) {
        if (map[6][5] == 2) {
            return true;
        }
        if (map[i][j] == 0) {
            map[i][j] = 2;
            if (findWay2(map, i - 1, j)) {//行走策略:上 右 下 左
                return true;
            }
            else if (findWay2(map, i, j + 1)) {
                return true;
            }
            else if (findWay2(map, i + 1, j)) {
                return true;
            }
            else if (findWay2(map, i, j - 1)) {
                return true;
            }
            else {
                map[i][j] = 3;
                return false;
            }
        }
        else {//map[i][j] == 1 or 2 or 3(1:障碍物, 2:该位置已走过了, 3:该位置不通)
            return false;
        }
    }
}