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

和695差不多，695求面积(dfs经过的点的数量），这里是求连通分量（多少次dfs或者bfs)

class Solution {
private:
    vector<vector<int> > direction = {{-1,0},{1,0},{0,-1},{0,1}};
    void dfs(vector<vector<char>>& grid, int x, int y)
    {
        if(x<0 || x>=grid.size() || y<0 || y>=grid[0].size() || grid[x][y]!= '1') return;
        grid[x][y] = '0';
        for(int i = 0; i < 4; i++)
        {
            int nx = x + direction[i][0];
            int ny = y + direction[i][1];
            dfs(grid, nx, ny);
        }
        return ;
    }
public:
    int numIslands(vector<vector<char>>& grid) {
        int res = 0;
        for(int i = 0; i < grid.size(); i++)
        {
            for(int j = 0; j < grid[0].size(); j++)
            {
                if(grid[i][j] != '0')
                {
                    dfs(grid, i, j);
                    res++;
                }
            }
        }
        return res;
    }
};

class Solution {
public:
    int numIslands(vector<vector<char>>& grid) {
        int res = 0;
        if(!grid.size()) return 0;
        for(int i = 0; i < grid.size(); i++)
        {
            for(int j = 0; j < grid[0].size(); j++)
            {
                if(grid[i][j] == '1')
                {
                    res++;
                    grid[i][j] = '0';
                    queue<pair<int,int> > q;
                    q.push(make_pair(i, j));
                    while(!q.empty())
                    {
                        int x = q.front().first;
                        int y = q.front().second;
                        q.pop();
                        if(x - 1 >= 0 && grid[x-1][y] == '1')
                        {
                            q.push(make_pair(x-1,y));
                            grid[x-1][y] = '0';
                        }      
                        if(x + 1 < grid.size() && grid[x+1][y] == '1')
                        {
                            q.push(make_pair(x+1, y));
                            grid[x+1][y] = '0';
                        }       
                        if(y - 1 >= 0 && grid[x][y-1] == '1')
                        {
                            q.push(make_pair(x,y-1));
                            grid[x][y-1] = '0';
                        }                        
                        if(y + 1 < grid[0].size() && grid[x][y+1] == '1')
                        {
                            q.push(make_pair(x, y+1));
                            grid[x][y+1] = '0';
                        }        
                    }
                }
            }
        }
        return res;
    }
};