leetcode_200. 岛屿数量

给定一个由 ‘1’（陆地）和 ‘0’（水）组成的的二维网格，计算岛屿的数量。一个岛被水包围，并且它是通过水平方向或垂直方向上相邻的陆地连接而成的。你可以假设网格的四个边均被水包围。
示例 1:
输入:
11110
11010
11000
00000
输出: 1
示例 2:
输入:
11000
11000
00100
00011
输出: 3
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/number-of-islands
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

//dfs
class Solution {
public:
    void dfs(vector<vector<char>>& grid,int i,int j)
    {
        if(i<0 || i>grid.size()-1 || j<0 || j>grid[0].size()-1)
        {
            return;
        }
        if(grid[i][j]=='1')
        {
            grid[i][j]='0';
            dfs(grid,i+1,j);
            dfs(grid,i,j+1);
            dfs(grid,i-1,j);
            dfs(grid,i,j-1);
        }
    }
    int numIslands(vector<vector<char>>& grid) {
        int result=0;
        for(int i=0;i<grid.size();++i)
        {
            for(int j=0;j<grid[0].size();++j)
            {
                if(grid[i][j]=='1')
                {
                    result+=1;
                    dfs(grid,i,j);
                }
            }
        }
        return result;
    }
};
//bfs
class Solution {
public:
    void bfs(vector<vector<char>>& grid,deque<vector<int> >& buffer)
    {
        while(buffer.size())
        {
            int x=buffer.front()[0];
            int y=buffer.front()[1];
            buffer.pop_front();
            if(x-1>=0 && grid[x-1][y]=='1')
            {
                grid[x-1][y]='0';
                buffer.push_back(vector<int>{x-1,y});
            }
            if(x+1<grid.size() && grid[x+1][y]=='1')
            {
               grid[x+1][y]='0';
                buffer.push_back(vector<int>{x+1,y});
            }
            if(y-1>=0 && grid[x][y-1]=='1')
            {
                grid[x][y-1]='0';
                buffer.push_back(vector<int>{x,y-1});
            }
            if(y+1<grid[0].size() && grid[x][y+1]=='1')
            {
                grid[x][y+1]='0';
                buffer.push_back(vector<int>{x,y+1});
            }
        }
    }
    int numIslands(vector<vector<char>>& grid) {
        int result=0;
        deque<vector<int> >buffer;
        for(int i=0;i<grid.size();++i)
        {
            for(int j=0;j<grid[0].size();++j)
            {
                if(grid[i][j]=='1')
                {
                    result+=1;
                    grid[i][j]='0';
                    buffer.push_back(vector<int>{i,j});
                    bfs(grid,buffer);
                }
            }
        }
        return result;
    }
};