leetcode 200-岛屿数量

给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。

岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。

此外，你可以假设该网格的四条边均被水包围。

示例 1：

输入：grid = [
  ["1","1","1","1","0"],
  ["1","1","0","1","0"],
  ["1","1","0","0","0"],
  ["0","0","0","0","0"]
]
输出：1

示例 2：

输入：grid = [
  ["1","1","0","0","0"],
  ["1","1","0","0","0"],
  ["0","0","1","0","0"],
  ["0","0","0","1","1"]
]
输出：3

提示：

m == grid.length
n == grid[i].length
1 <= m, n <= 300
grid[i][j] 的值为 '0' 或 '1'

思路：

当找到一个陆地后，让岛屿数量加一，然后将其能到达的所有陆地都标记成海；

//广搜
int n, m;

void dfs(char** grid, int row, int col){
    if(row < 0 || row >= n || col < 0 || col >= m)
        return;
    if(grid[row][col] == '1')
        grid[row][col] = '0';
    else
        return ;

    dfs(grid, row + 1, col);
    dfs(grid, row , col + 1);
    dfs(grid, row - 1, col);
    dfs(grid, row , col - 1);
    return;

}

int numIslands(char** grid, int gridSize, int* gridColSize){
    n = gridSize;       //行
    m = *gridColSize;   //列

    int count = 0;      //岛屿数
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            if(grid[i][j]=='1'){
                count++;
                dfs(grid, i, j);
            }
        }
    }
    return count;
}