【leetcode】1030. Matrix Cells in Distance Order

最新推荐文章于 2020-11-17 23:07:17 发布

飞奔的六六

最新推荐文章于 2020-11-17 23:07:17 发布

阅读量292

点赞数

分类专栏：练习 OJ 文章标签： leetcode java

本文链接：https://blog.csdn.net/Art1st_D/article/details/89447194

版权

OJ 同时被 2 个专栏收录

31 篇文章 0 订阅

订阅专栏

练习

28 篇文章 1 订阅

订阅专栏

BFS

class Solution {
    public int[][] allCellsDistOrder(int R, int C, int r0, int c0) {
        int[][] Matrix = new int[R*C][2];
        Queue<int[]> queue = new LinkedList();
        boolean[][] visited = new boolean[R][C];

        int idx = 0;
        queue.offer(new int[]{r0, c0});
        
        while (!queue.isEmpty()) {
            int[] cell = queue.poll();
            int row = cell[0];
            int colume = cell[1];

            if (row<0 || row>=R || colume<0 || colume>=C || visited[row][colume])
                continue;

            Matrix[idx++] = cell;
            visited[row][colume] = true;

            queue.offer(new int[]{row-1,colume});
            queue.offer(new int[]{row,colume-1});
            queue.offer(new int[]{row+1,colume});
            queue.offer(new int[]{row,colume+1});
        }
        return Matrix;
    }

}