LeetCode200. Number of Islands （思路及python解法）

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Example 1:

Input:
11110
11010
11000
00000

Output: 1

---

一道统计连通区域的题，有很强的实用性。之前在分类，图像处理等领域有所应用过。

做这道题的思路是用DFS方法，发现一处“1”后，将这个“1”所连通的所有1都找出来，并进行标记，做为其中一个island。

重点在于注意dfs所用的条件。

visited是用于判别该点是否已经在dfs过程中访问过。

在创建的时候注意先是in range(c),然后才是in range(r),这点需要注意。

而dfs的判定条件i和j的范围也需要注意。

判定的顺序也需要注意，i，j的范围正确了才能继续去判定grid[i][j]=='0' or visited[i][j]

class Solution:
    def numIslands(self, grid: List[List[str]]) -> int:
        if not grid:return 0
        r, c = len(grid), len(grid[0])
        visited = [[False for _ in range(c)] for _ in range(r)]

        def dfs(i,j):
            if i<0 or j<0 or i>=r or j>=c or grid[i][j]=='0' or visited[i][j]:
                return
            visited[i][j]=True
            dfs(i+1, j)
            dfs(i-1, j)
            dfs(i, j+1)
            dfs(i, j-1)

        count=0
        for i in range(r):
            for j in range(c):
                if not visited[i][j] and grid[i][j]=='1':
                    dfs(i, j)
                    count += 1
        return count