LeetCode 695. Max Area of Island解题报告(python)

orientliu96

于 2019-12-18 18:22:59 发布

阅读量387

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode python

本文链接：https://blog.youkuaiyun.com/Orientliu96/article/details/103602443

LeetCode 专栏收录该内容

98 篇文章

订阅专栏

本文介绍了解决LeetCode 695题目的Python解决方案，通过深度优先搜索（DFS）算法寻找二维数组中最大岛屿的面积，详细解析了代码实现与核心思路。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

695. Max Area of Island

Max Area of Island python solution

题目描述

Given a non-empty 2D array grid of 0’s and 1’s, an island is a group of 1’s (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.
Find the maximum area of an island in the given 2D array. (If there is no island, the maximum area is 0.)
在这里插入图片描述

解析

这次题目和之前的LeetCode 1254. Number of Closed Islands类似，思想大致相同。
见我之前的博客跳转链接

class Solution:
    def maxAreaOfIsland(self, grid: List[List[int]]) -> int:
        if not grid:
            return 0
        m,n=len(grid),len(grid[0])  
        res=0
        
        def dfs(i,j,val):
            if(0<=i<m and 0<=j<n and grid[i][j]==1):
                grid[i][j]=val
                return 1+dfs(i+1,j,-1)+dfs(i-1,j,-1)+dfs(i,j+1,-1)+dfs(i,j-1,-1)
            return 0

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