给你一个由 ‘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’
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/number-of-islands
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
这题类似二叉树的遍历,也是深度优先遍历,只是停止条件有些不同,本质的原理是一样的
class Solution:
def numIslands(self, grid: List[List[str]]) -> int:
result = 0
for row in range(len(grid)):
for column in range(len(grid[0])):
if grid[row][column] == "1":
self.dfs(grid, row, column)
result += 1
return result
def dfs(self, grid: List[List[str]], row: int, column):
# 处理越界问题
if row < 0 or column < 0 or row > len(grid) - 1 or column > len(grid[0]) -1:
return
# 如果是“0”、“2”,则直接返回
if grid[row][column] != "1":
return
# 如果是“1”,就改为“2”,表示已经扫描过的陆地
grid[row][column] = "2"
self.dfs(grid, row - 1, column)
self.dfs(grid, row, column - 1)
self.dfs(grid, row + 1, column)
self.dfs(grid, row, column + 1)