本文主要是介绍Lc200 小岛数量,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
每次碰到‘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 ddef 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' or visit[i][j]:returnvisit[i][j] = Trueself.dfs(grid,visit,i-1,j)self.dfs(grid,visit,i+1,j)self.dfs(grid,visit,i,j+1)self.dfs(grid,visit,i,j-1)def numIslands(self, grid: List[List[str]]) -> int:if not grid or len(grid) == 0 or not grid[0] or len(grid[0])==0:return 0m,n = len(grid),len(grid[0])visit = self._init_2d(m,n)num = 0for i in range(m):for j in range(n):if grid[i][j] == '0' or visit[i][j]:continuenum+=1self.dfs(grid,visit,i,j)return num
这篇关于Lc200 小岛数量的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!