BFS解决多源最短路问题_飞地的数量、地图中的最高点、地图分析_C++

---

0. 前言

---

BFS解决多源最短路问题的思路较为固定，这里不做过多讲解，重在练习。

---

1. 飞地的数量

---

leetcode链接：https://leetcode.cn/problems/number-of-enclaves/description/

1. 思路

• 本题严格意义上来说，属于FloodFill问题，可以用多源BFS解决也可以用单源BFS解决。

2. 单源BFS解题

• 正难则反，先遍历所有边上的陆地，把联通的区域都改为0，之后直接计算图中有多少个1即可。

class Solution {
    int dx[4] = {0, 0, 1, -1};
    int dy[4] = {1, -1, 0, 0};
    int m, n;
public:
    void bfs(vector<vector<int>>& grid, int i, int j)
    {
        vector<vector<int>> dist(m, vector(n, -1));
        queue<pair<int, int>> q;
        q.push({i, j});
        grid[i][j] = 0;
        dist[i][j] = 0;

        while(q.size())
        {
            auto [a, b] = q.front();
            q.pop();
            for (int i = 0; i < 4; i++)
            {
                int x = a + dx[i], y = b + dy[i];
                if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] && dist[x][y] == -1)
                {
                    q.push({x, y});
                    grid[x][y] = 0;
                    dist[x][y] = dist[a][b] + 1;
                }
            }
        }
    }

    int numEnclaves(vector<vector<int>>& grid) 
    {
        m = grid.size(), n = grid[0].size();

        for (int i = 0; i < m; i++)
        {
            if (grid[i][0] == 1) bfs(grid, i, 0);
            if (grid[i][n - 1] == 1) bfs(grid, i, n - 1);
        } 

        for (int i = 0; i < n; i++)
        {
            if (grid[0][i] == 1) bfs(grid, 0, i);
            if (grid[m - 1][i] == 1) bfs(grid, m - 1, i);
        }

        int count = 0;
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
            {
                if (grid[i][j] == 1) count++;
            }
        }

        return count;
    }
};

3. 多源BFS解题

class Solution {
    int dx[4] = {0, 0, 1, -1};
    int dy[4] = {1, -1, 0, 0};
    int m, n;
   
public:
    int numEnclaves(vector<vector<int>>& grid) 
    {
        m = grid.size(), n = grid[0].size();
        vector<vector<bool>> vis(m, vector<bool>(n));
        queue<pair<int, int>> q;

		// 这里懒省事了，直接遍历所有的位置，将在边上且为陆地的位置入队
        for (int i = 0; i < m; i++)
            for (int j = 0; j < n; j++)
                if (i == 0 || i == m - 1 || j == 0 || j == n - 1)
                {
                    if (grid[i][j] == 1)
                    {
                        q.push({i, j});
                        vis[i][j] = true;
                    }
                }
            
        while(q.size())
        {
            auto [a, b] = q.front();
            q.pop();
            for (int i = 0; i < 4; i++)
            {
                int x = a + dx[i], y = b + dy[i];
                if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] && !vis[x][y])
                {
                    q.push({x, y});
                    vis[x][y] = true;
                }
            }
        }

        int count = 0;
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
            {
                if (grid[i][j] == 1 && !vis[i][j]) count++;
            }
        }

        return count;
    }
};

---

2. 地图中的最高点

---

leetcode链接：https://leetcode.cn/problems/map-of-highest-peak/description/

class Solution {
    int dx[4] = {0, 0, 1, -1};
    int dy[4] = {1, -1, 0, 0};
    int m, n;
public:
    vector<vector<int>> highestPeak(vector<vector<int>>& isWater) 
    {
        m = isWater.size(), n = isWater[0].size();
        vector<vector<int>> dist(m, vector<int>(n, -1));
        queue<pair<int, int>> q;
        for (int i = 0; i < m; i++)
            for (int j = 0; j < n; j++)
            {
                if (isWater[i][j] == 1)
                {
                    q.push({i, j});
                    dist[i][j] = 0;
                }
            }

        while(q.size())
        {
            auto [a, b] = q.front();
            q.pop();
            for (int i = 0; i < 4; i++)
            {
                int x = a + dx[i], y = b + dy[i];
                if (x >= 0 && x < m && y >= 0 && y < n && isWater[x][y] == 0 && dist[x][y] == -1)
                {
                    q.push({x, y});
                    dist[x][y] = dist[a][b] + 1;
                }
            }
        }

        return dist;
    }
};

---

3. 地图分析

---

leetcode链接：https://leetcode.cn/problems/as-far-from-land-as-possible/description/

class Solution {
    int dx[4] = {0, 0, 1, -1};
    int dy[4] = {1, -1, 0, 0};
    int m, n;
public:
    int maxDistance(vector<vector<int>>& grid) 
    {
        m = grid.size(), n = grid[0].size();
        vector<vector<int>> dist(m, vector<int>(n, -1));
        queue<pair<int, int>> q;

        for (int i = 0; i < m; i++)
            for (int j = 0; j < n; j++)
            {
                if (grid[i][j] == 1)
                {
                    q.push({i, j});
                    dist[i][j] = 0;
                }
            }

        int ret = -1;
        while (q.size())
        {
            auto [a, b] = q.front();
            q.pop();
            for (int i = 0; i < 4; i++)
            {
                int x = a + dx[i], y = b + dy[i];
                if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] == 0 && dist[x][y] == -1)
                {
                    q.push({x, y});
                    dist[x][y] = dist[a][b] + 1;
                    ret = max(ret, dist[x][y]);
                }
            }
        }
        
        return ret;
    }
};

---