题目
给定一个包含了一些 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’。
示例 2:
[[0,0,0,0,0,0,0,0]]
对于上面这个给定的矩阵, 返回 0。
注意:
给定的矩阵grid 的长度和宽度都不超过 50。
分析
本题主要考察深度搜索,使用dfs查找单个岛屿面积。查询过的岛屿由1
变2
,防止重复搜索。
代码
public int maxAreaOfIsland(int[][] grid) {
int re = 0;
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[i].length; j++) {
if (grid[i][j] == 1){
re = Math.max(re,dfs(grid,i,j));
}
}
}
return re;
}
//查询单个岛屿面积
int dfs(int[][] grid, int i, int j ){
int tem = 0;
if (grid[i][j] == 1){
grid[i][j] = 2;
//记录岛屿改变的1(面积)
tem ++;
if (i-1>=0 && grid[i-1][j] == 1){
tem += dfs(grid, i-1, j);
} if (j-1>=0 && grid[i][j-1] == 1){
tem += dfs(grid, i, j-1);
} if (i+1<grid.length && grid[i+1][j] == 1){
tem += dfs(grid, i+1, j);
}if (j+1<grid[i].length && grid[i][j+1] == 1){
tem += dfs(grid, i, j+1);
}
}
return tem;
}