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

class Solution:
    def numIslands(self, grid: List[List[str]]) -> int:
        if not grid :
            return 0
        rmax=len(grid)
        cmax=len(grid[0])

        def dfs (r,c):
            if r<0 or c<0 or r>=rmax or c>=cmax or grid[r][c]=='0':
                return        
            else:
                grid[r][c]="0"
            dfs(r+1,c)
            dfs(r,c+1)
            dfs(r-1,c)
            dfs(r,c-1)
        count=0
        for i in range(rmax):
            for j in range(cmax):
                if grid[i][j]=="1":
                    count+=1
                    dfs(i,j)
        return count