图论15（Leetcode1091.二进制矩阵中的最短路径）

从月亮走向月亮7

已于 2023-09-18 14:53:11 修改

阅读量50

点赞数

文章标签：图论矩阵算法

于 2023-09-18 11:44:40 首次发布

本文链接：https://blog.csdn.net/stacey777/article/details/132971192

版权

答案：

class Solution {
    public int shortestPathBinaryMatrix(int[][] grid) {
        int n = grid.length;
        if(grid[0][0]!=0)return -1;
        if(grid[n-1][n-1]!=0)return -1;
        int step = 0;
        Queue<int[]> queue = new LinkedList<>();
        int start[] = {0,0};
        queue.add(start);
        while(queue.size()!=0){
            step++;
            int len = queue.size();
            for(int i=0;i<len;i++){
                int[] cur = queue.poll();
                int x = cur[0];
                int y = cur[1];
                if(x==n-1&&y==n-1){
                    return step;
                }
                if(x-1>=0&&grid[x-1][y]==0){
                    int[] point = {x-1,y};
                    queue.add(point);
                    grid[x-1][y]=-1;
                }
                if(x+1<grid.length&&grid[x+1][y]==0){
                    int[] point = {x+1,y};
                    queue.add(point);
                    grid[x+1][y]=-1;
                }
                if(y-1>=0&&grid[x][y-1]==0){
                    int[] point = {x,y-1};
                    queue.add(point);
                    grid[x][y-1]=-1;
                }
                if(y+1<grid.length&&grid[x][y+1]==0){
                    int[] point = {x,y+1};
                    queue.add(point);
                    grid[x][y+1]=-1;
                }
                if(x+1<grid.length&&y+1<grid.length&&grid[x+1][y+1]==0){
                    int[] point = {x+1,y+1};
                    queue.add(point);
                    grid[x+1][y+1]=-1;
                }
                if(x+1<grid.length&&y-1>=0&&grid[x+1][y-1]==0){
                    int[] point = {x+1,y-1};
                    queue.add(point);
                    grid[x+1][y-1]=-1;
                }
                if(x-1>=0&&y+1<grid.length&&grid[x-1][y+1]==0){
                    int[] point = {x-1,y+1};
                    queue.add(point);
                    grid[x-1][y+1]=-1;
                }
                if(x-1>=0&&y-1>=0&&grid[x-1][y-1]==0){
                    int[] point = {x-1,y-1};
                    queue.add(point);
                    grid[x-1][y-1]=-1;
                }
            }
        }
        return -1;
    }
}