[Leetcode] 每日两题 200 1254 -day102 DFS解决岛屿问题（1）

DFS解决岛屿问题（1）

200. 岛屿数量

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

        #vis = [[0]*n for _ in range(m)]

        def dfs(i,j):
            grid[i][j] = '0'
            for x,y in [[i+1,j],[i-1,j],[i,j+1],[i,j-1]]:
                if 0<=x<m and 0<=y<n  and grid[x][y]=='1':
                    dfs(x,y)
        res = 0
        for i in range(m):
            for j in range(n):
                if  grid[i][j]=='1':
                    res +=1
                    dfs(i,j)
        return res 

1254. 统计封闭岛屿的数目

class Solution:
    def closedIsland(self, grid: List[List[int]]) -> int:
        
        m , n = len(grid),len(grid[0])
        res= 0 
        def dfs(x,y):            
            grid[x][y]=1
            for  i,j in [[x+1,y],[x-1,y],[x,y+1],[x,y-1]]:
                if 0<=i<m and 0<=j<n and grid[i][j]==0:
                    dfs(i,j)

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