【leetcode 广度优先搜索 C++】1162. As Far from Land as Possible

最新推荐文章于 2024-07-23 07:45:00 发布

笨比master

最新推荐文章于 2024-07-23 07:45:00 发布

阅读量114

点赞数

分类专栏： leetcode 文章标签：算法 leetcode

本文链接：https://blog.csdn.net/m0_37454852/article/details/113872539

版权

leetcode 专栏收录该内容

288 篇文章 0 订阅

订阅专栏

1162. As Far from Land as Possible

在这里插入图片描述

class Solution {
public:
    int maxDistance(vector<vector<int>>& grid) {
        queue<pair<int, int>> Q;
        int H = grid.size();
        int W = grid[0].size();
        int ans = -1;
        int y, x;
        vector<vector<bool> > visited(H, vector<bool>(W, false));
        for(int ii = 0; ii < H; ii++) {
            for(int jj = 0; jj < W; jj++) {
                if(grid[ii][jj]) {
                    Q.push({ii, jj});
                    visited[ii][jj] = true;
                }
            }
        }
        if(Q.size() == H*W || Q.size() == 0) return ans;
        while(!Q.empty()) {
            int len = Q.size();
            for(int ii = 0; ii < len; ii++) {
                auto A = Q.front();
                Q.pop();
                y = A.first - 1, x = A.second;
                if(y >= 0 && y < H && !visited[y][x]) {
                    visited[y][x] = true;
                    Q.push({y, x});
                }
                y = A.first + 1, x = A.second;
                if(y >= 0 && y < H && !visited[y][x]) {
                    visited[y][x] = true;
                    Q.push({y, x});
                }
                y = A.first, x = A.second - 1;
                if(x >= 0 && x < W && !visited[y][x]) {
                    visited[y][x] = true;
                    Q.push({y, x});
                }
                y = A.first, x = A.second + 1;
                if(x >= 0 && x < W && !visited[y][x]) {
                    visited[y][x] = true;
                    Q.push({y, x});
                }
            }
            ans++;
        }
        return ans;
    }
};