【LeetCode】200. 岛屿数量

题目

200. 岛屿数量

难度中等1557收藏分享切换为英文接收动态反馈

给你一个由 '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：

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

提示：

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

思路

• 遍历所有的点，若该点为1则是岛屿，将其周围所有的陆地都设置为水

代码

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

复杂度

• 时间复杂度：$O(mn)$
• 空间复杂度：$O(mn)$