每次碰到‘1’就用DFS遍历联通的1,把遍历的1标记为已访问; dfs单独写成一个函数 class Solution: def _init_2d(self,row,col): d= [] for i in range(row): d.append([]) for j in range(col): d[i].append(False) return d def dfs(self,grid,visit,i,j): m,n = len(grid),len(grid[0]) if i<0 or i>=m or j<0 or j>=n or grid[i][j] == '0...