200. 岛屿数量

找到‘1’后向周围扩散，搜索到的‘1’全置为‘0’

class Solution {
public:
    void dfs(vector<vector<char>>& grid, int row, int col) {
        int rowMax = grid.size(), colMax = grid[0].size(); 
        grid[row][col] = '0';
        if (row - 1 >= 0 && grid[row - 1][col] == '1') dfs(grid, row - 1, col);
        if (row + 1 < rowMax && grid[row + 1][col] == '1') dfs(grid, row + 1, col);
        if (col - 1 >= 0 && grid[row][col - 1] == '1') dfs(grid, row, col - 1);
        if (col + 1 < colMax && grid[row][col + 1] == '1') dfs(grid, row, col + 1);
    }
    int numIslands(vector<vector<char>>& grid) {
        int row = grid.size(), col = grid[0].size();
        int ans = 0;
        for (int i = 0; i < row; ++i) {
            for (int j = 0; j < col; ++j) {
                if (grid[i][j] == '1') {
                    ++ans;
                    dfs(grid, i, j);
                }
            }
        }
        return ans;
    }
};