# 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 class Solution {

public int maxAreaOfIsland(int[][] grid) {
int count = 0;
int max = 0;
int n = grid.length;
if(n==0) return 0;
int m = grid[0].length;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(grid[i][j]==1){
count = markAsZero(grid,i,j,count);
if(count>max){
max = count;
}
count=0;
}
}
}
return max;
}
public int  markAsZero(int[][] grid, int i, int j,int count){
if(i<0||j<0||i>=grid.length||j>=grid[0].length||grid[i][j]==0) return count;

grid[i][j]=0;
count++;
count = markAsZero(grid,i-1,j,count);
count = markAsZero(grid,i,j-1,count);
count = markAsZero(grid,i+1,j,count);
count = markAsZero(grid,i,j+1,count);
return count;
}
}
``````

### 推荐阅读更多精彩内容

• **2014真题Directions:Read the following text. Choose the be...
又是夜半惊坐起阅读 7,662评论 0 23
• 生物与非生物的不同，是生物能在种群内不断进行着世代相传，即生死轮回的生殖和繁衍。 此一生生不息的繁衍过程，就构成了...
D012希玛太原阅读 69评论 0 1
• 生命之进程，亦是失去自我之过程。 自打上班后，哦不，自打出生后，小熊便抑郁了 抑郁像是新生儿的第一口呼吸，原生，却...
Cornig阅读 212评论 0 1
• 这一刻，栀子花开，我们知道离离别不远了！ “叮——叮”铃声响起了，走廊上还是如此安静！那是即将步入中考...
淡然_回眸阅读 61评论 0 0