剑指 Offer II 105. 岛屿的最大面积

题目链接

力扣

题目描述

给定一个由 0 和 1 组成的非空二维数组 grid ，用来表示海洋岛屿地图。

一个 岛屿 是由一些相邻的 1 (代表土地) 构成的组合，这里的「相邻」要求两个 1 必须在水平或者竖直方向上相邻。你可以假设 grid 的四个边缘都被 0（代表水）包围着。

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

示例 1:

输入: grid = [[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
解释: 对于上面这个给定矩阵应返回 6。注意答案不应该是 11 ，因为岛屿只能包含水平或垂直的四个方向的 1 。
示例 2:

输入: grid = [[0,0,0,0,0,0,0,0]]
输出: 0
 

提示：

m == grid.length
n == grid[i].length
1 <= m, n <= 50
grid[i][j] is either 0 or 1

解题思路

dfs

代码

Python

class Solution:
    def maxAreaOfIsland(self, grid: list[list[int]]) -> int:
        m, n = len(grid), len(grid[0])
        vis = [[False] * n for _ in range(m)]

        def dfs(i: int, j: int) -> int:
            ret = 1
            vis[i][j] = True
            if i > 0 and grid[i - 1][j] == 1 and not vis[i - 1][j]:
                ret += dfs(i - 1, j)
            if i < m - 1 and grid[i + 1][j] == 1 and not vis[i + 1][j]:
                ret += dfs(i + 1, j)
            if j > 0 and grid[i][j - 1] == 1 and not vis[i][j - 1]:
                ret += dfs(i, j - 1)
            if j < n - 1 and grid[i][j + 1] == 1 and not vis[i][j + 1]:
                ret += dfs(i, j + 1)
            return ret
        ans = 0
        for i in range(m):
            for j in range(n):
                if grid[i][j] == 1 and not vis[i][j]:
                    ans = max(ans, dfs(i, j))
        return ans