# Very simple DFS Java solution

• ``````    public int maxAreaOfIsland(int[][] grid) {
if (grid == null || grid.length == 0) {
return 0;
}
int m = grid.length;
int n = grid[0].length;
int max = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid[i][j] == 1) {
int area = dfs(grid, i, j, m, n, 0);
max = Math.max(area, max);
}
}
}
return max;
}

int dfs(int[][] grid, int i, int j, int m, int n, int area) {
if (i < 0 || i >= m || j < 0 || j >= n || grid[i][j] == 0) {
return area;
}
grid[i][j] = 0;
area++;
area = dfs(grid, i + 1, j, m, n, area);
area = dfs(grid, i, j + 1, m, n, area);
area = dfs(grid, i - 1, j, m, n, area);
area = dfs(grid, i, j - 1, m, n, area);
return area;
}
``````

• Similar idea.

``````class Solution {
public int maxAreaOfIsland(int[][] grid) {
int max = 0;
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (grid[i][j] == 1) {
max = Math.max(max, helper(grid, i, j));
}
}
}
return max;
}
public int helper(int[][] grid, int i, int j) {
if (i < 0 || i >= grid.length || j < 0 || j >= grid[0].length || grid[i][j] == 0) {
return 0;
}
grid[i][j] = 0;
return 1 + helper(grid, i - 1, j) + helper(grid, i + 1, j) + helper(grid, i, j - 1) + helper(grid, i, j + 1);
}
}
``````

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.