LeetCode 200 岛屿数量

最新推荐文章于 2024-06-14 08:49:18 发布

一杯小熊

最新推荐文章于 2024-06-14 08:49:18 发布

阅读量51

点赞数

分类专栏： LeetCode DFS

本文链接：https://blog.csdn.net/sinat_40469883/article/details/115615697

版权

LeetCode 同时被 2 个专栏收录

32 篇文章 0 订阅

订阅专栏

DFS

2 篇文章 0 订阅

订阅专栏

class Solution:
    def numIslands(self, grid: [[str]]) -> int:
        def dfs(grid, i, j):
            if not 0 <= i < len(grid) or not 0 <= j < len(grid[0]) or grid[i][j] == '0': return
            grid[i][j] = '0'
            dfs(grid, i + 1, j)
            dfs(grid, i, j + 1)
            dfs(grid, i - 1, j)
            dfs(grid, i, j - 1)
        count = 0
        for i in range(len(grid)):
            for j in range(len(grid[0])):
                if grid[i][j] == '1':
                    dfs(grid, i, j)
                    count += 1
        return count

class Solution:
    def numIslands(self, grid: List[List[str]]) -> int:
        #bfs
        def bfs(grid, i, j):
            queue = collections.deque()
            queue.append([i, j])
            while queue:
                [i, j] = queue.popleft()
                if 0 <= i < len(grid) and 0 <= j < len(grid[0]) and grid[i][j] == '1':
                     grid[i][j] = '0'
                     queue += [[i-1, j], [i+1, j], [i, j-1], [i, j+1]]
        count = 0
        for i in range(len(grid)):
            for j in range(len(grid[0])):
                if grid[i][j] == '1':
                    bfs(grid, i, j)
                    count += 1
        return count