[LeetCode]200. 岛屿数量

200. 岛屿数量

难度：中等

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

---

class Solution:
    def numIslands(self, grid: List[List[str]]) -> int:
        m, n = len(grid), len(grid[0])
        res = 0

        def func(i,j):
            grid[i][j] = '0'
            for vi, vj in [[-1,0],[1,0],[0,1],[0,-1]]:
                newi, newj = vi + i, vj + j
                if m > newi >= 0 and n > newj >= 0 and grid[newi][newj] == '1':
                    func(newi, newj)

        for i in range(m):
            for j in range(n):
                if grid[i][j] == '1':
                    res += 1
                    func(i, j)
        
        return res