LeetCode 695. Max Area of Island
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.)
Example 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]]
Given the above grid, return 6. Note the answer is not 11, because the island must be connected 4-directionally.
Example 2:
[[0,0,0,0,0,0,0,0]]
Given the above grid, return 0.
Note: The length of each dimension in the given grid does not exceed 50.
分析:求最大连通域。图的深度优先遍历算法。
代码参考:
public int maxAreaOfIsland(int[][] grid) {
int maxArea=0;
//int currentArea=0;
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length ; j++) {
if(grid[i][j] == 1)
{
maxArea=Math.max(eraArea(grid,i,j,1),maxArea);
}
}
}
return maxArea;
}
public int eraArea(int[][] grid,int i,int j,int currentArea)
{
/*访问过就设置为0*/
grid[i][j]=0;
if((i-1) >=0 && grid[i-1][j] == 1)
{
currentArea++;
currentArea=eraArea(grid,i-1,j,currentArea);
}
if((j-1) >=0&& grid[i][j-1] == 1)
{
currentArea++;
currentArea=eraArea(grid,i,j-1,currentArea);
}
if((i+1) < grid.length && grid[i+1][j] == 1)
{
currentArea++;
currentArea=eraArea(grid,i+1,j,currentArea);
}
if((j+1)<grid[0].length && grid[i][j+1] == 1)
{
currentArea++;
currentArea=eraArea(grid,i,j+1,currentArea);
}
return currentArea;
}