BFS解决FloodFill算法_岛屿数量、岛屿面积、岛屿周长_C++

---

1. 岛屿数量

---

1.1 题目描述

---

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

给你一个由 ‘1’（陆地）和 ‘0’（水）组成的的二维网格，请你计算网格中岛屿的数量。岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。此外，你可以假设该网格的四条边均被水包围。

示例 1：

输入：
grid = [
  ["1","1","1","1","0"],
  ["1","1","0","1","0"],
  ["1","1","0","0","0"],
  ["0","0","0","0","0"]
]
输出：1

示例 2：

输入：grid = [
  ["1","1","0","0","0"],
  ["1","1","0","0","0"],
  ["0","0","1","0","0"],
  ["0","0","0","1","1"]
]
输出：3

提示：

m == grid.length
n == grid[i].length
1 <= m, n <= 300
grid[i][j] 的值为 '0' 或 '1'

---

1.2 算法分析

---

这道题不同于“图像渲染”，它涉及到一个死循环访问的问题。

["1","1","0","0","0"]
["1","1","0","0","0"]
["0","0","1","0","0"]
["0","0","0","1","1"]

在上面的网格中，假设我们先从[0][0]位置开始BFS搜索，假设会先访问到[0][1]的位置。随后在[0][1]位置开始BFS搜索时，会再次访问到[0][0]，这样就会产生循环访问。

解决方案有两种：

• a.将访问过的位置，由 “1” 置 “0”。这种方式会修改原数组，要根据题目慎重使用。
• b.设计一个bool类型的visit数组，记录哪些位置被访问过了，哪些位置没有，以此来避免循环访问。

---

1.3 代码实现

---

class Solution {
    int dx[4] = {0, 0, 1, -1};
    int dy[4] = {1, -1, 0, 0};
    bool vis[301][301];		// visit数组
    int m, n;   // 行，列

public:
    void bfs(vector<vector<char>>& grid, int i, int j)
    {
        queue<pair<int, int>> q;
        q.push({i, j});
        vis[i][j] = true;

        while(q.size())
        {
            auto [a, b] = q.front();
            q.pop();

            for (int k = 0; k < 4; k++)
            {
                int x = a + dx[k], y = b + dy[k];
                if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] == '1' && !vis[x][y])
                {
                    q.push({x, y});
                    vis[x][y] = true;
                }
            }
        }
    }

    int numIslands(vector<vector<char>>& grid) 
    {
        m = grid.size(), n = grid[0].size();
        int ret = 0;
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
            {
                if (grid[i][j] == '1' && !vis[i][j])
                {
                    ret++;
                    bfs(grid, i, j);    // 把这块陆地全标记一下
                }
            }
        }

        return ret;
    }
};

---

2. 岛屿面积

---

leetcode链接：https://leetcode.cn/problems/ZL6zAn/submissions/569282784/

class Solution {
    int dx[4] = {0, 0, 1, -1};
    int dy[4] = {1, -1, 0, 0};
    bool vis[51][51];
    int m, n;   // 行，列

public:
    int bfs(vector<vector<int>>& grid, int i, int j)
    {
        int ret = 1;
        queue<pair<int, int>> q;
        q.push({i, j});
        vis[i][j] = true;

        while (q.size())
        {
            auto [a, b] = q.front();
            q.pop();

            for (int k = 0; k < 4; k++)
            {
                int x = a + dx[k], y = b + dy[k];
                if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] == 1 && !vis[x][y])
                {
                    vis[x][y] = true;
                    q.push({x, y});
                    ret++;
                }
            }
        }
        
        return ret;
    }

    int maxAreaOfIsland(vector<vector<int>>& grid) 
    {
        m = grid.size(), n = grid[0].size();
        priority_queue<int> pq;
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
            {
                if (grid[i][j] == 1 && !vis[i][j])
                {
                    int ret = bfs(grid, i, j);
                    pq.push(ret);
                }
            }
        }

        return pq.empty() ? 0 : pq.top();
    }
};

---

3. 岛屿周长

---

leetcode链接：https://leetcode.cn/problems/island-perimeter/

class Solution {
    int dx[4] = {0, 0, 1, -1};
    int dy[4] = {1, -1, 0, 0};
    bool vis[101][101];
    int m, n;
public:
    int islandPerimeter(vector<vector<int>>& grid) 
    {
        // 1. 先随便找一块陆地
        int i = 0, j = 0;
        int flag = 0;
        m = grid.size(), n = grid[0].size();
        for (; i < m; i++)
        {
            j = 0;
            for (; j < n; j++)
            {
                if (grid[i][j] == 1) 
                {
                    flag = 1;
                    break;
                }
            }
            if (flag) break;
        }

        // 处理没有岛屿的情况
        if (j == n && i == m) return 0;

        // 2. 计算周长
        int length = 0;
        queue<pair<int, int>> q;
        q.push({i, j});
        vis[i][j] = true;

        while(q.size())
        {
            auto [a, b] = q.front();
            q.pop();

            for (int k = 0; k < 4; k++)
            {
                int x = a + dx[k], y = b + dy[k];
                if (x >= 0 && x < m && y >= 0 && y < n)
                {
                    if (grid[x][y] == 1 && !vis[x][y])
                    {
                        q.push({x, y});
                        vis[x][y] = true;
                    }
                    else if (grid[x][y] == 0)
                    {
                        length++;
                    }
                }
                else
                {
                    length++;
                }
            }                        
        }

        return length;
     }
};

---