class Solution {
public:
int countSubIslands(vector<vector<int>>& grid1, vector<vector<int>>& grid2) {
int m = grid1.size(), n = grid10.size();
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
//说明不是子岛
if (grid1ij == 0 && grid2ij == 1) {
dfs(grid2, i, j);
}
}
}
int res = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid2ij == 1) {
res++;
dfs(grid2, i, j);
}
}
}
return res;
}
private:
void dfs(vector<vector<int>>& grid, int i, int j) {
int m = grid.size(), n = grid0.size();
if (i < 0 || j < 0 || i >= m || j >= n) {
return;
}
if (gridij == 0) {
return;
}
gridij = 0;
dfs(grid, i + 1, j);
dfs(grid, i, j + 1);
dfs(grid, i - 1, j);
dfs(grid, i, j - 1);
}
};