【刷题记录打卡】力扣200. 岛屿数量

int g_row;
int g_col;

bool isInArea(int r, int c)
{
if (r < 0 || r >= g_row || c < 0 || c >= g_col) {
return false;
}
return true;
}

void dfs(char** grid, int r, int c)
{
if (!isInArea(r, c)) {
return;
}
if (grid[r][c] != ‘1’) {
return;
}
grid[r][c] = ‘0’;
dfs(grid, r + 1, c);
dfs(grid, r - 1, c);
dfs(grid, r, c + 1);
dfs(grid, r, c - 1);
return;
}

int numIslands(char** grid, int gridSize, int* gridColSize){
g_row = gridSize;
g_col = *gridColSize;
int res = 0;
for (int i = 0; i < g_row; i++) {
for (int j = 0; j < g_col; j++) {
if (grid[i][j] == ‘1’) {
res++;
dfs(grid, i, j);
}
}
}
return res;
}

总结：
岛屿类(网格)问题基本都可以用dfs来解决。有一篇写的很好的总结，从二叉树类的dfs到网格类的dfs做了类比，很好理解。
https://leetcode.cn/problems/number-of-islands/solutions/211211/dao-yu-lei-wen-ti-de-tong-yong-jie-fa-dfs-bian-li-/