2021-07-22

leetcode200
dfs这个也是参考了别人的题解，不知道我什么时候才能独立写出题解，要把做过的题再做一遍？

class Solution {
public:
    void dfs(vector<vector<char>>& grid,int r,int c,int nr,int nc) 
    {
        grid[r][c]='0';
        if(r-1>=0&&grid[r-1][c]=='1') dfs(grid,r-1,c,nr,nc);
        if(r+1<nr&&grid[r+1][c]=='1') dfs(grid,r+1,c,nr,nc);
        if(c-1>=0&&grid[r][c-1]=='1') dfs(grid,r,c-1,nr,nc);
        if(c+1<nc&&grid[r][c+1]=='1') dfs(grid,r,c+1,nr,nc);
    }

    int numIslands(vector<vector<char>>&grid)
    {
        int nr=grid.size();
        if(!nr) return 0;
        int nc=grid[0].size();
        int count=0;
        for(int i=0;i!=nr;++i)
        {
            for(int j=0;j!=nc;++j)
            {
                if(grid[i][j]=='1')
                {
                    count++;
                    dfs(grid,i,j,nr,nc);
                }
            }
        }  
        return count;  
    }
};

END