class Solution {
public int maxAreaOfIsland(int[][] grid) {
int maxArea = 0;
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (grid[i][j] == 1) {
int[] curMaxArea = new int[]{0};
maxAreaOfIslandHelper(i, j, grid, curMaxArea);
maxArea = Math.max(maxArea, curMaxArea[0]);
}
}
}
return maxArea;
}
private void maxAreaOfIslandHelper(int i, int j, int[][] grid, int[] maxArea) {
if (i < 0 || j < 0 || i > grid.length - 1 || j > grid[0].length - 1 || grid[i][j] == 0) {
return;
}
grid[i][j] = 0;
maxArea[0] += 1;
int[][] dirs = {`{-1, 0}, {1, 0}, {0, -1}, {0, 1}`};
for (int[] dir : dirs) {
maxAreaOfIslandHelper(i + dir[0], j + dir[1], grid, maxArea);
}
}
}