leetcode——200. 岛屿数量

思路

1. 广度优先搜索（队列），岛屿的数量即广度优先搜索的次数
2. 如何对访问过的节点进行标记？——从1置0
3. 如何广度搜索？——上下左右都搜索（注意出界判断）
4. 队列不能是二维的，类型需要置为pair<int,int>

代码

class Solution {
public:
    int numIslands(vector<vector<char>>& grid) {
        if(grid.size()==0) return 0;
        //获取网格行列
        int nr = grid.size();
        int nc = grid[0].size();

        //对网格进行行列遍历
        int num_islands = 0;
        for (int r = 0; r < nr; ++r) {
            for (int c = 0; c < nc; ++c) {
                if (grid[r][c] == '1') {
                    ++num_islands;
                    grid[r][c] = '0';
                    //将其作为根结点放入
                    queue<pair<int, int>> neighbors;
                    neighbors.push({r, c});
                    while (!neighbors.empty()) {
                        //队列头结点弹出
                        auto rc = neighbors.front();neighbors.pop();
                        int row = rc.first, col = rc.second;
                        //上下左右——出界判断+广度搜索
                        if (row - 1 >= 0 && grid[row-1][col] == '1') {
                            neighbors.push({row-1, col});
                            grid[row-1][col] = '0';
                        }
                        if (row + 1 < nr && grid[row+1][col] == '1') {
                            neighbors.push({row+1, col});
                            grid[row+1][col] = '0';
                        }
                        if (col - 1 >= 0 && grid[row][col-1] == '1') {
                            neighbors.push({row, col-1});
                            grid[row][col-1] = '0';
                        }
                        if (col + 1 < nc && grid[row][col+1] == '1') {
                            neighbors.push({row, col+1});
                            grid[row][col+1] = '0';
                        }
                    }
                }
            }
        }
        return num_islands;
    }
};