Reference: LeetCode

Difficulty: Medium

## Problem

Given a non-empty 2D array

`grid`

of 0’s and 1’s, anislandis 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`

.)

**Note:** The length of each dimension in the given grid does not exceed `50`

.

**Example:**

1 | [[0,0,1,0,0,0,0,1,0,0,0,0,0], |

## Analysis

### DFS

For each position in the array, we do DFS and count how many `1`

it can reach. Instead of using a mark array, we can simply set the visited position as `0`

.

1 | public int maxAreaOfIsland(int[][] grid) { |

**Time:** $O(MN)$**Space:** $O(MN)$