链接
https://leetcode-cn.com/problems/max-area-of-island/
前言
题目
给定一个包含了一些 0
和 1
的非空二维数组 grid 。
一个岛屿是由一些相邻的 1
(代表土地) 构成的组合,这里的「相邻」要求两个 1
必须在水平或者竖直方向上相邻。你可以假设 grid
的四个边缘都被 0
(代表水)包围着。
找到给定的二维数组中最大的岛屿面积。(如果没有岛屿,则返回面积为 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
。
示例2:
[[0,0,0,0,0,0,0,0]]
对于上面这个给定的矩阵, 返回 0。
注意: 给定的矩阵grid
的长度和宽度都不超过 50。
关键
思路1
- 使用深度优先搜索(DFS)遍历
class Solution:
global Dir
Dir = [-1, 0, 1, 0, -1]
def maxAreaOfIsland(self, grid: List[List[int]]) -> int:
max_area = 0
if len(grid)==0 or len(grid[0])==0:
return 0
for i in range(len(grid)):
for j in range(len(grid[0])):
if grid[i][j]==1:
max_area = max(max_area, self.DFS(grid, i, j))
return max_area
def DFS(self, grid: List[List[int]], m, n):
if grid[m][n]==0:
return 0
area = 1
grid[m][n] = 0
for i in range(4):
x = m + Dir[i]
y = n + Dir[i+1]
if x >=0 and y >= 0 and x < len(grid) and y < len(grid[0]):
area += self.DFS(grid, x, y)
return area
思路2
- 更好理解的DFS代码
- DFS(i,j):找点(i,j)相邻的岛屿–递归思想;注意递归出口:直到矩阵边界
- 注意要把找过的岛屿标记为0,避免重复查找
- 遍历所有点,去找岛屿的最大值
max(res, DFS(i,j))
–可能有好几块岛屿
class Solution:
def maxAreaOfIsland(self, grid: List[List[int]]) -> int:
m, n = len(grid), len(grid[0])
def DFS(i,j):
if 0 <= i <m and 0 <= j < n and grid[i][j]:
grid[i][j] = 0
return 1 + DFS(i-1, j) + DFS(i+1, j) + DFS(i, j-1) + DFS(i, j+1)
return 0
res = 0
for i in range(m):
for j in range(n):
if grid[i][j]:
res = max(res, DFS(i,j))
return res