该题与岛屿数量这道题类似,思路也差不多,可去岛屿数量这篇文章中看看思路和代码。
思路:
该题的思路就是在岛屿生成函数createIsLands中添加area参数,每次生成一个小岛屿就加1,递归调用自身,直到生成一个大岛屿,返回area,这个area就是这个大岛屿的面积,然后与当前最大面积比较,哪个大哪个是最大面积,遍历完整个二维数组之后,就可以得到岛屿的最大面积了
代码:
class Solution {
public int maxAreaOfIsland(int[][] grid) {
int maxArea = 0;
int area = 0;
int arr[][] = new int[grid.length][grid[0].length];
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (arr[i][j] == 0 && grid[i][j] == 1) {
area = createIsLands(i , j,grid,arr,0);
if(area > maxArea){
maxArea = area;
}
}
}
}
return maxArea;
}
public static int createIsLands(int i,int j,int[][] grid,int arr[][],int area) {
arr[i][j] = 1;
area++;
if(i - 1 >= 0 && arr[i - 1][j] == 0 && grid[i - 1][j] == 1){
area = createIsLands(i - 1, j,grid,arr,area);
}
if(i + 1 <= grid.length - 1 && arr[i + 1][j] == 0 && grid[i + 1][j] == 1){
area = createIsLands(i + 1, j,grid,arr,area);
}
if(j - 1 >= 0 && arr[i][j - 1] == 0 && grid[i][j - 1] == 1){
area = createIsLands(i, j - 1,grid,arr,area);
}
if(j + 1 <= grid[0].length - 1 && arr[i][j + 1] == 0 && grid[i][j + 1] == 1){
area = createIsLands(i, j + 1,grid,arr,area);
}
return area;
}
}