Leetcode｜200. 岛屿数量【笔记】

链接

https://leetcode-cn.com/problems/number-of-islands/

前言

与题695. 岛屿的最大面积类似

题目

给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。
岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。
此外，你可以假设该网格的四条边均被水包围。
示例1：

输入：grid = [
  ["1","1","1","1","0"],
  ["1","1","0","1","0"],
  ["1","1","0","0","0"],
  ["0","0","0","0","0"]
]
输出：1

示例2：

[[0,0,0,0,0,0,0,0]]

对于上面这个给定的矩阵, 返回 0。
注意: 给定的矩阵grid 的长度和宽度都不超过 50。
提示

• m == grid.length
• n == grid[i].length
• 1 <= m, n <= 300
• grid[i][j] 的值为 '0' 或 '1'

关键

本人思路

• 使用深度优先搜索（DFS）遍历
• 找到一个岛area_num+1

class Solution:
    global Dir
    Dir = [-1, 0, 1, 0, -1]
    def numIslands(self, grid: List[List[int]]) -> int:
        area_num = 0
        if len(grid)==0 or len(grid[0])==0:
            return 0
        for i in range(len(grid)):
            for j in range(len(grid[0])):
                if grid[i][j]=="1":
                	self.DFS(grid, i, j)
                    area_num+=1
        return area_num
        
    def DFS(self, grid: List[List[int]], m, n): 
       
        if grid[m][n]=="0":
            return 0
        area = 1
        grid[m][n] = "0"
        for i in range(4):
            x = m + Dir[i]
            y = n + Dir[i+1]
            if x >=0 and y >= 0 and x < len(grid) and y < len(grid[0]):
                area += self.DFS(grid, x, y)
        return area

思路2

• dfs找点(i,j)相邻的陆地，直到找遍这个岛屿
• 遍历矩阵，找编某个岛屿上的陆地后res += 1

class Solution:
    def numIslands(self, grid: List[List[str]]) -> int:
        m, n = len(grid), len(grid[0])
        def dfs(i,j):
            if 0 <= i < m and 0 <= j < n and grid[i][j]=="1":
                grid[i][j] = "0"
                return dfs(i-1,j)+dfs(i+1,j)+dfs(i,j-1)+dfs(i,j+1)
            return 0
        res = 0
        for i in range(m):
            for j in range(n):
                if grid[i][j]=="1":
                    dfs(i,j)
                    res += 1
        return res

疑问

参考

[1] 沉岛思想岛屿问题（数量/面积）python模板