【题目】
【分析】
使用DFS遍历 grid2,并检查岛屿的所有格子是否在 grid1 中也是 1
【代码】
class Solution:
def countSubIslands(self, grid1: List[List[int]], grid2: List[List[int]]) -> int:
cnt=0
def dfs(x,y):
if x>=0 and x<len(grid2) and y>=0 and y<len(grid2[0]) and grid2[x][y]==1:
grid2[x][y]=0
return grid1[x][y] & dfs(x-1,y) & dfs(x+1,y) & dfs(x,y-1) & dfs(x,y+1)
return True
for i in range(len(grid2)):
for j in range(len(grid2[0])):
if grid2[i][j]==1:
cnt+=dfs(i,j)
return cnt