leetcode 200. Number of Islands-蒲公英云

leetcode 200. Number of Islands

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Example 1:

Answer: 1

Example 2:

Answer: 3

找最大联通量

class Solution {
public:
    int numIslands(vector<vector<char>>& grid) {
        if (grid.empty() || grid[0].empty())
            return 0;
        int cnt = 0;
        for (int i = 0; i < grid.size(); i++)
        {
            for (int j = 0; j < grid[0].size(); j++)
            {
                if (grid[i][j] == '1')
                {
                    cnt++;
                    vector<pair<int, int>>quene;//(x,y)
                    grid[i][j] = '0';
                    quene.push_back(pair<int, int>(j, i));
                    while (!quene.empty())
                    {
                        int x = quene.back().first;
                        int y = quene.back().second;
                        quene.pop_back();
                        if (x - 1 >= 0 && grid[y][x - 1] == '1')
                        {
                            grid[y][x - 1] = '0';
                            quene.push_back(pair<int, int>(x - 1, y));
                        }
                        if (y - 1 >= 0 && grid[y-1][x ] == '1')
                        {
                            grid[y-1][x] = '0';
                            quene.push_back(pair<int, int>(x , y-1));
                        }
                        if (x + 1 <grid[0].size() && grid[y][x + 1] == '1')
                        {
                            grid[y][x + 1] = '0';
                            quene.push_back(pair<int, int>(x + 1, y));
                        }
                        if (y + 1 <grid.size() && grid[y+1][x] == '1')
                        {
                            grid[y+1][x] = '0';
                            quene.push_back(pair<int, int>(x, y+1));
                        }
                    }
                }
            }
        }
        return cnt;
    }
};