[leetcode] Number of Islands

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:

11110
11010
11000
00000

Answer: 1

Example 2:

11000
11000
00100
00011

Answer: 3

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

 

分析： 对每次出现'1'的区域进行计数，同时深度或广度遍历，然后置为'x'。

class Solution
{
private:
  void dfs(vector<vector<char> > &grid, int x, int y)
  {
    if(x <  || x >= grid.size()) return;
    if(y <  || y >= grid[].size()) return;
    if(grid[x][y] != '') return;

    grid[x][y] = 'x';
    dfs(grid, x-, y);
    dfs(grid, x+, y);
    dfs(grid, x, y-);
    dfs(grid, x, y+);
  }
public:
  int numIslands(vector<vector<char> > &grid)
  {
    if(grid.empty() || grid[].empty()) return ;
    int X = grid.size(), Y = grid[].size();
    int count = ;

    for(int i=; i<X; i++)
    {
      for(int j=; j<Y; j++)
      {
        if(grid[i][j] == '')
        {
          count++;
          dfs(grid, i, j);
        }
      }
    }

    return count;
  }
};