Leetcode刷题笔记(c++)_热题 HOT 100_200. 岛屿数量

深度搜索

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