leetcode 深度优先搜索

200. 岛屿数量

class Solution(object):
    def numIslands(self, grid):
        m, n = len(grid), len(grid[0])
        ans = 0
        def dfs(i, j):
            if 0 <= i < m and 0 <= j < n and grid[i][j] == '1':
                grid[i][j] = '0'
                dfs(i + 1, j)
                dfs(i - 1, j)
                dfs(i, j - 1)
                dfs(i, j + 1)
        for i in range(m):
            for j in range(n):
                if grid[i][j] == '1':
                    ans += 1
                    dfs(i, j)
        return ans