题解 | 岛屿数量

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 判断岛屿数量
# @param grid char字符型二维数组 
# @return int整型
#
class Solution:
    def solve(self , grid: List[List[str]]) -> int:
        # write code here
        c_long = len(grid)
        c_wide = len(grid[0])

        ans = 0

        def seach_1(grid, i, j):
            if grid[i][j] == '1':
                # 沉岛策略
                grid[i][j] = '0'
                if i + 1 < c_long:
                    seach_1(grid, i + 1, j)
                if j + 1 < c_wide:
                    seach_1(grid, i, j + 1)
                if i - 1 >= 0:
                    seach_1(grid, i - 1, j)
                if j - 1 >= 0:
                    seach_1(grid, i, j - 1)

        for i in range(0, c_long):
            for j in range(0, c_wide):
                if grid[i][j] == '1':
                    ans += 1
                    seach_1(grid, i, j)
        return ans