Count Sub Islands

三无提督w

于 2022-03-03 07:53:09 发布

阅读量234

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM 文章标签：动态规划 leetcode 算法

本文链接：https://blog.csdn.net/cf260469080/article/details/123244592

ACM 专栏收录该内容

94 篇文章

订阅专栏

Source: Count Sub Islands - LeetCode

题解

class Solution:
    def countSubIslands(self, grid1: List[List[int]], grid2: List[List[int]]) -> int:
        m=len(grid1);n=len(grid1[0])

        def dfs(x, y):
            if  (0 <= x < m and 0 <= y < n) and (grid2[x][y] == 1):
                grid2[x][y] = -1
                _d=dfs(x + 1, y)
                _u=dfs(x - 1, y)
                _l=dfs(x, y - 1)
                _r=dfs(x, y + 1)
                return (_d and _u and _l and _r and grid1[x][y]==1)
            return True

        c=0
        for i in range(m):
            for j in range(n):
                if grid2[i][j]==1:
                    if dfs(i,j):c+=1

        return c