leetcode 200.岛屿数量

给你一个由 '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'

//BFS找出岛屿上的所有‘1’
class Solution {
public:
    bool st[300][300];
    typedef pair<int,int> PII;
    int m,n;
    queue <PII> q;
    // queue<int,int> q;
    void bfs(vector<vector<char>>& grid,int i,int j){
        q.push({i,j});
        while(!q.empty()){
            auto x=q.front();
            q.pop();
            int a=x.first;
            int b=x.second;
            st[a][b]=true;
            int xl[4]={-1,1,0,0};
            int yl[4]={0,0,-1,1};
            for(int i=0;i<4;i++){
                if(a+xl[i]<0||a+xl[i]>=m||b+yl[i]<0||b+yl[i]>=n) continue;
                if(grid[a+xl[i]][b+yl[i]]=='1'&&!st[a+xl[i]][b+yl[i]]){
                    st[a+xl[i]][b+yl[i]]=true;
                    q.push({a+xl[i],b+yl[i]});
                }
            }
        }
    }
    int numIslands(vector<vector<char>>& grid) {
        int res=0;
        m=grid.size();
        n=grid[0].size();
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if(!st[i][j]&&grid[i][j]=='1'){
                    res++;
                    bfs(grid,i,j);
                }
            }
        }
        return res;
    }
};