思路:
dfs即可. 把所有遍历到的岛上的1都换成0. 也可以bfs, 有兴趣的尝试一下, 要拿个队列.
void dfs(vector<vector<char>>& grid, int i, int j) {
if (i < 0 || i >= grid.size() || j < 0 || j >= grid[0].size() || grid[i][j] != '1')
return;
grid[i][j] = '0';
dfs(grid, i - 1, j);
dfs(grid, i + 1, j);
dfs(grid, i, j - 1);
dfs(grid, i, j + 1);
}
int numIslands(vector<vector<char>>& grid) {
int count = 0;
int m = grid.size();
if (! m) return 0;
int n = grid[0].size();
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid[i][j] == '1') {
dfs(grid, i, j);
count++;
}
}
}
return count;
}