leetcode刷题日记:200. 岛屿数量（python）

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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/number-of-islands
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

---

class Solution:
    def dfs(self,grid,r,c):
        #往四个方向搜索
        directions = [[-1,0],[1,0],[0,1],[0,-1]]
        #搜索到之后将当前置零
        grid[r][c] = 0
        rows = len(grid)
        cols = len(grid[0])
        for direction in directions:
            #获得当前的坐标值
            x = r+direction[0]
            y = c+direction[1]
            #若当前为1(陆地)则继续递归找到0(海)
            if 0 <= x < rows and 0 <= y < cols and grid[x][y] == "1":
                self.dfs(grid,x,y)
    def numIslands(self, grid: List[List[str]]) -> int:
        rows = len(grid)
        cols = len(grid[0])
        if rows == 0:
            return 0
        res = 0
        for i in range(rows):
            for j in range(cols):
                if grid[i][j] == '1':
                    #当前为1的话则找到一个岛屿
                    res +=1
                    #递归找到所有相连的陆地并将他们置于0
                    self.dfs(grid,i,j)
        return res