class Solution {
public:
void dfs(vector<vector<int>>& grid,int x,int y,int m,int n){
for (int k=0;k<4;k++){
int xx=x+d[k][0];
int yy=y+d[k][1];
if (xx<0||yy<0||xx>=m||yy>=n||!grid[xx][yy]) continue;
grid[xx][yy]=0;
cnt++;
dfs(grid,xx,yy,m,n);
}
}
int maxAreaOfIsland(vector<vector<int>>& grid) {
int m=grid.size();
if (!m) return 0;
int n=grid[0].size();
res=0;
for (int i=0;i<m;i++){
for (int j=0;j<n;j++){
cnt=0;
if (grid[i][j]){
grid[i][j]=0;
cnt++;
dfs(grid,i,j,m,n);
res=max(res,cnt);
}
}
}
return res;
}
int d[4][2]={1,0,0,1,-1,0,0,-1};
int res,cnt;
};