数据结构-广度搜索BFS

给定一个包含了一些 0 和 1的非空二维数组 grid , 一个 岛屿 是由四个方向 (水平或垂直) 的 1 (代表土地) 构成的组合。你可以假设二维矩阵的四个边缘都被水包围着。

找到给定的二维数组中最大的岛屿面积。(如果没有岛屿，则返回面积为0。)

示例 1:
[[0,0,1,0,0,0,0,1,0,0,0,0,0],
[0,0,0,0,0,0,0,1,1,1,0,0,0],
[0,1,1,0,1,0,0,0,0,0,0,0,0],
[0,1,0,0,1,1,0,0,1,0,1,0,0],
[0,1,0,0,1,1,0,0,1,1,1,0,0],
[0,0,0,0,0,0,0,0,0,0,1,0,0],
[0,0,0,0,0,0,0,1,1,1,0,0,0],
[0,0,0,0,0,0,0,1,1,0,0,0,0]]

对于上面这个给定矩阵应返回 6。注意答案不应该是11，因为岛屿只能包含水平或垂直的四个方向的‘1’。

class Solution:
    def maxAreaOfIsland(self, grid: List[List[int]]) -> int:
        if not grid:return 0
        areas = []
        visit = [[0 for _ in range(len(grid[0]))] for __ in range(len(grid))]
        steps = [[1,0],[-1,0],[0,1],[0,-1]]
        
        # BFS搜索
        def BFS(x,y):
            area = 1
            queue = [(x,y)]
            visit[x][y] = 1
            while queue:
                p = queue.pop(0)
                for i in steps:
                    dx, dy = p[0] + i[0], p[1] + i[1]
                    if 0 <= dx < len(grid) and 0 <= dy < len(grid[0]) and grid[dx][dy] == 1 and visit[dx][dy] == 0:
                        visit[dx][dy] = 1
                        area += 1
                        queue.append((dx, dy))
            areas.append(area)
                        
        for i in range(len(grid)):
            for j in range(len(grid[0])):
                if grid[i][j] == 1 and visit[i][j] == 0:
                    BFS(i,j)
        return max(areas) if areas else 0