给定一个包含了一些 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。
package com.loo;
import java.util.LinkedList;
import java.util.Queue;
public class MaxIslandArea {
public static int[] DX = new int[] {1 , 0 , -1 , 0};
public static int[] DY = new int[] {0 , 1 , 0 , -1};
public static void main(String[] args) {
int[][] grid1 = {
{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}
};
int[][] grid2 = new int[][] {{0,0,0,0,0,0,0,0}};
System.out.println(getMaxIslandArea1(grid1));
System.out.println(getMaxIslandArea2(grid2));
}
// 深度优先。一个土地上,以 4 个方向探索与之相连的每一个土地(以及与这些土地相连的土地),那么探索过的土地总数将是该连通形状的面积。
// 为了确保每个土地访问不超过一次,每次经过一块土地时,将这块土地的值置为 0。这样就不会多次访问同一土地。
public static int getMaxIslandArea1(int[][] grid) {
if (grid == null || grid.length==0 || grid[0].length==0) {
return 0;
}
int m = grid.length;
int n = grid[0].length;
int maxArea = 0;
for (int i=0;i<m;i++) {
for (int j=0;j<n;j++) {
if (grid[i][j]==1) {
maxArea = Math.max(maxArea, dfs(grid , i , j));
}
}
}
return maxArea;
}
public static int dfs(int[][] grid , int x , int y) {
if (x<0 || x>=grid.length || y<0 || y>=grid[0].length || grid[x][y]==0) {
return 0;
}
grid[x][y] = 0;
int result = 1;
for (int k=0;k<4;k++) {
int dx = x + DX[k];
int dy = y + DY[k];
result += dfs(grid , dx , dy);
}
return result;
}
// 广度优先
public static int getMaxIslandArea2(int[][] grid) {
if (grid == null || grid.length==0 || grid[0].length==0) {
return 0;
}
int m = grid.length;
int n = grid[0].length;
int maxArea = 0;
for (int i=0;i<m;i++) {
for (int j=0;j<n;j++) {
int area = 0;
if (grid[i][j]==1) {
area++;
grid[i][j] = 0;
Queue<Integer> queue = new LinkedList<Integer>();
queue.add(i*n+j);
while (!queue.isEmpty()) {
int value = queue.poll();
int x = value/n;
int y = value%n;
for (int k=0;k<4;k++) {
int dx = x + DX[k];
int dy = y + DY[k];
if (dx<0 || dx>=grid.length || dy<0 || dy>=grid[0].length || grid[dx][dy]==0) {
continue;
}
if (grid[dx][dy]==1) {
queue.add(dx*n+dy);
area++;
grid[dx][dy] = 0;
}
}
}
}
maxArea = Math.max(maxArea, area);
}
}
return maxArea;
}
}