Leetcode刷题笔记(c++)

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