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

695. Max Area of Island

695. 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

Reference

https://leetcode.com/problems/max-area-of-island/discuss/108541/easy-python