# 200. Number of Islands

Difficulty: Medium

Frequency: N/A

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```

Example 2:

```11000
11000
00100
00011```

My solution:

Data structure:
Steps:
Complexity:
Runtime:
Space:
Test cases:
Corner cases:
Code:

Another solution:
Data structure:
steps:
Complexity:
Runtime:
Space:
Code:
```class Solution {
public:
int numIslands(vector<vector<char>>& grid) {
if (grid.size() == 0 || grid.size() == 0) return 0;
int result = 0;
for (int i = 0; i < grid.size(); i++) {
for (int j = 0; j < grid.size(); j++) {
if (grid[i][j] == '1') {
result++;
DFS(grid, i, j);
}
}
}
return result;
}
void DFS(vector<vector<char>>& grid, int i, int j) {
grid[i][j] = '0';
if (i > 0 && grid[i - 1][j] == '1') DFS(grid, i - 1, j);
if (i < grid.size() - 1 && grid[i + 1][j] == '1') DFS(grid, i + 1, j);
if (j > 0 && grid[i][j - 1] == '1') DFS(grid, i, j - 1);
if (j < grid.size() - 1 && grid[i][j + 1] == '1') DFS(grid, i, j+ 1);
}
};
```

Things to learn: