leetcode 200. Number of Islands
2017-08-09 15:59
399 查看
class Solution(object): def dfs(self,grid,i,j): if i < 0 or j < 0 or i >= len(grid) or j >= len(grid[0]) or grid[i][j] == '0': return grid[i][j] = '0' self.dfs(grid,i+1,j) self.dfs(grid,i,j+1) self.dfs(grid,i-1,j) self.dfs(grid,i,j-1) def numIslands(self, grid): """ :type grid: List[List[str]] :rtype: int """ count = 0 for i in range(len(grid)): for j in range(len(grid[0])): if grid[i][j] == '1': count += 1 self.dfs(grid,i,j) return count
相关文章推荐
- LeetCode:M-200. Number of Islands
- LeetCode 200. Number of Islands
- leetcode解题之200. Number of Islands Java版(岛屿的数量)
- LeetCode 200. Number of Islands
- leetcode 200. Number of Islands(DFS)
- [LeetCode]200. Number of Islands
- 【LeetCode】200. Number of Islands (2 solutions)
- 【leetcode】200. Number of Islands
- LeetCode 200. Number of Islands(小岛)
- leetcode200. Number of Islands
- [leetcode] 200. Number of Islands 解题报告
- Leetcode-200. Number of Islands
- DFS求岛的个数LeetCode 200. Number of Islands
- leetcode 200. Number of Islands DFS
- LeetCode 200. Number of Islands
- [LeetCode] 200. Number of Islands
- LeetCode *** 200. Number of Islands (Depth-first Search)
- LeetCode-200. Number of Islands
- LeetCode 200. Number of Islands (DFS)
- leetcode 200. Number of Islands 十分典型的DFS深度优先遍历