给你一个由 '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'
链接:https://leetcode-cn.com/problems/number-of-islands
class Solution:
def numIslands(self, grid: List[List[str]]) -> int:
row, col, count = len(grid), len(grid[0]), 0
def dfs(x, y):
gris[x][y] = '0'
for c in [(0,1),(0,-1),(-1,0),(1,0)]:
nx, ny = x + c[0], y + c[1]
if 0<= nx < row and 0<= ny < col and grid[nx][ny] == '1':
dfs(nx, ny)
for i in range(row):
for j in range(col):
if grid[i][j] == '1':
dfs(i,j)
count += 1
return count
Leetcode 200 岛屿数量 (每日一题 20210720)
最新推荐文章于 2024-07-05 09:03:01 发布