走迷宫BFS

leglk

已于 2024-04-15 18:30:28 修改

阅读量307

点赞数 2

文章标签：宽度优先 java 算法

于 2024-04-15 18:12:20 首次发布

本文链接：https://blog.csdn.net/weixin_74870257/article/details/137790416

版权

文章介绍了使用Java编程语言实现的迷宫路径寻找算法，通过广度优先搜索(BFS)方法，并利用系统Queue类来简化代码。

摘要由CSDN通过智能技术生成

acwing 844 题：走迷宫代码（java）

package Main;


import java.util.Arrays;
import java.util.Scanner;

public class Main {

    static int N = 110;

    static int n;
    static int m;
    static int g[][] = new int[N][N]; //
    static int d[][] = new int[N][N]; // dp
    static PII q[] = new PII[N * N];

    public static int bfs() {
        int hh = 0, tt = 0; // 初始化队头和队尾为0
        q[0] = new PII(0, 0); // 一开始第一个节点入队
        for (int i = 0; i < N; i++) {  // 将d数组初始化为-1
            Arrays.fill(d[i], -1);
        }
        d[0][0] = 0;// 已经走过（0，0）

        // 技巧 上右下左
        int[] dx = new int[]{-1, 0, 1, 0};
        int[] dy = new int[]{0, 1, 0, -1};

        while (hh <= tt) { // 队列只要不空
            PII t = q[hh++]; // 每次取出队头元素
            for (int i = 0; i < 4; i++) {
                int x1 = t.x + dx[i], y1 = t.y + dy[i];
                if (x1>=0&&x1<n&&y1>=0&&y1<m&&g[x1][y1] == 0&&d[x1][y1]==-1){
                    d[x1][y1] = d[t.x][t.y] + 1;
                    q[++tt] = new PII(x1,y1);
                }
            }
        }


        return d[n-1][m-1];
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        n = scanner.nextInt();
        m = scanner.nextInt();
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                g[i][j] = scanner.nextInt();
            }
        }

        System.out.println(bfs());

    }

    static class PII {
        public int x;
        public int y;

        public PII(int x, int y) {
            this.x = x;
            this.y = y;
        }
    }


}

用系统的Queue实现更加简单

package Main;

import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class Main {

    static int N = 110;
    static int[][] g = new int[N][N];
    static int[][] d = new int[N][N];
    static int n, m;
//    static PII[] q = new PII[N * N]; // 队列，等下尝试用系统队列
    static Queue<PII> q2 = new LinkedList<>();

    public static int bfs() {
//        int hh = 0, tt = 0;
//        q[0] = new PII(0,0);
        q2.add(new PII(0,0));

        for (int i = 0; i < N; i++) { // d数组初始化为-1
            Arrays.fill(d[i], -1);
        }
        d[0][0] = 0;


        int[] dx = new int[]{-1, 0, 1, 0};
        int[] dy = new int[]{0, 1, 0, -1};


        while (!q2.isEmpty()) {
//            PII t = q[hh++];
            PII t = q2.poll();
            for (int i = 0; i < 4; i++) {
                int x = t.x + dx[i], y = t.y + dy[i];
                if (x >= 0 && x < m && y >= 0 && y < n && g[x][y] == 0 && d[x][y] == -1) {
                    d[x][y] = d[t.x][t.y] + 1;
//                    q[++tt] = new PII(x, y);
                    q2.add(new PII(x,y));
                }
            }

        }

        return d[n-1][m-1];
    }


    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        n = scanner.nextInt();
        m = scanner.nextInt();
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                g[i][j] = scanner.nextInt();
            }
        }

        System.out.println(bfs());

    }

    static class PII {
        public int x;
        public int y;

        public PII(int x, int y) {
            this.x = x;
            this.y = y;
        }
    }

}