力扣：200. 岛屿数量（Python3）

最新推荐文章于 2024-08-20 10:34:34 发布

恽劼恒

最新推荐文章于 2024-08-20 10:34:34 发布

阅读量136

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法 python

本文链接：https://blog.csdn.net/yunjieheng/article/details/134899580

版权

LeetCode 专栏收录该内容

163 篇文章 1 订阅

订阅专栏

题目：

给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。

岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。

此外，你可以假设该网格的四条边均被水包围。

来源：力扣（LeetCode）
链接：力扣（LeetCode）官网 - 全球极客挚爱的技术成长平台

示例：

示例 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

解法：

遍历每个点，如果为1，计数+1并把周围相邻的1标记为2。

代码：

class Solution:
    def numIslands(self, grid: List[List[str]]) -> int:
        count = 0

        def infect(r, c):
            if 0 <= r < len(grid) and 0 <= c < len(grid[0]) and grid[r][c] == '1':
                grid[r][c] = '2'
                infect(r + 1, c)
                infect(r - 1, c)
                infect(r, c + 1)
                infect(r, c - 1)

        for idr, r in enumerate(grid):
            for idc, c in enumerate(r):
                if c == '1':
                    infect(idr, idc)
                    count += 1
        return count