蓝桥迷宫 BFS最短路阅读理解 java

最新推荐文章于 2024-10-01 09:29:45 发布

兑生

最新推荐文章于 2024-10-01 09:29:45 发布

阅读量64

点赞数

分类专栏：算法文章标签： java 宽度优先算法

本文链接：https://blog.csdn.net/lt6666678/article/details/130932185

版权

算法专栏收录该内容

184 篇文章 2 订阅

订阅专栏

🍑 算法题解专栏

🍑 迷宫

在这里插入图片描述

输入

2 1
1 1 2 2

输出

0.75

`⭐ 每个点可能有多个传送门`

`⭐ 数组一定要开到足够大`

🍑 ArrayList存传送门版

import java.util.*;

public class Main
{
    static int N = 5, n, m;
    static int[][] g = new int[N][N];
    static boolean[][] st = new boolean[N][N];
    static ArrayList[][] to = new ArrayList[N][N];
    static int[][] dist = new int[N][N];
    static int[] dx = { -1, 0, 1, 0 };
    static int[] dy = { 0, 1, 0, -1 };

    static class Node
    {
        int x;
        int y;

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

    static void bfs(int sx, int sy)
    {
        st[sx][sy] = true;
        dist[sx][sy] = 0;
        LinkedList<Node> q = new LinkedList<>();
        q.add(new Node(sx, sy));
        while (!q.isEmpty())
        {
            Node t = q.poll();
            int x = t.x;
            int y = t.y;
            int d = dist[x][y];
            for (int i = 0; i < 4; i++)
            {
                int xx = dx[i] + x;
                int yy = dy[i] + y;
                if (xx <= 0 || xx > n || yy <= 0 || yy > n)
                    continue;
                if (st[xx][yy])
                    continue;
                st[xx][yy] = true;
                q.add(new Node(xx, yy));
                dist[xx][yy] = d + 1;
            }
            ArrayList<Node> list = to[x][y];
            for (int i = 0; i < list.size(); i++)
            {
//                int xx = to[x][y].x;
//                int yy = to[x][y].y;
                int xx = list.get(i).x;
                int yy = list.get(i).y;
                if (!st[xx][yy] || xx <= 0 || yy <= 0 || xx > n || yy > n)
                {
                    dist[xx][yy] = d + 1;
                    st[xx][yy] = true;
                    q.add(new Node(xx, yy));
                }
            }
        }
    }

    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        m = sc.nextInt();
        for (int i = 0; i < N; i++)
            for (int j = 0; j < N; j++)
                to[i][j] = new ArrayList<Node>();

        for (int i = 0; i < m; i++)
        {
            int x = sc.nextInt();
            int y = sc.nextInt();
            int xx = sc.nextInt();
            int yy = sc.nextInt();
            to[x][y].add(new Node(xx, yy));
            to[xx][yy].add(new Node(x, y));

//            to[x][y] = new Node(xx, yy);
//            to[xx][yy] = new Node(x, y);
        }
        bfs(n, n);
        double ans = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                ans += dist[i][j];
        System.out.printf("%.2f", ans / n / n);
    }
}

🍑 hashmap下标映射存传送门版

import java.util.*;

public class Main
{
    static int N = 2020, n, m;
    static int[][] g = new int[N][N];
    static boolean[][] st = new boolean[N][N];
    static ArrayList[][] to = new ArrayList[N][N];
    static int[][] dist = new int[N][N];
    static int[] dx = { -1, 0, 1, 0 };
    static int[] dy = { 0, 1, 0, -1 };

    static class Node
    {
        int x;
        int y;

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

    static void bfs(int sx, int sy)
    {
        st[sx][sy] = true;
        dist[sx][sy] = 0;
        LinkedList<Node> q = new LinkedList<>();
        q.add(new Node(sx, sy));
        while (!q.isEmpty())
        {
            Node t = q.poll();
            int x = t.x;
            int y = t.y;
            int d = dist[x][y];
            for (int i = 0; i < 4; i++)
            {
                int xx = dx[i] + x;
                int yy = dy[i] + y;
                if (xx <= 0 || xx > n || yy <= 0 || yy > n)
                    continue;
                if (st[xx][yy])
                    continue;
                st[xx][yy] = true;
                q.add(new Node(xx, yy));
                dist[xx][yy] = d + 1;
            }
            ArrayList<Node> list = to[x][y];
            for (int i = 0; i < list.size(); i++)
            {
//                int xx = to[x][y].x;
//                int yy = to[x][y].y;
                int xx = list.get(i).x;
                int yy = list.get(i).y;
                if (!st[xx][yy] || xx <= 0 || yy <= 0 || xx > n || yy > n)
                {
                    dist[xx][yy] = d + 1;
                    st[xx][yy] = true;
                    q.add(new Node(xx, yy));
                }
            }
        }
    }

    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        m = sc.nextInt();
        for (int i = 0; i < N; i++)
            for (int j = 0; j < N; j++)
                to[i][j] = new ArrayList<Node>();

        for (int i = 0; i < m; i++)
        {
            int x = sc.nextInt();
            int y = sc.nextInt();
            int xx = sc.nextInt();
            int yy = sc.nextInt();
            to[x][y].add(new Node(xx, yy));
            to[xx][yy].add(new Node(x, y));

//            to[x][y] = new Node(xx, yy);
//            to[xx][yy] = new Node(x, y);
        }
        bfs(n, n);
        double ans = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                ans += dist[i][j];
        System.out.printf("%.2f", ans / n / n);
    }
}