Skip to content

Commit 8105c2d

Browse files
committed
Time: 29 ms (57.15%), Space: 23.2 MB (67.07%) - LeetHub
1 parent 8c71631 commit 8105c2d

File tree

1 file changed

+34
-0
lines changed

1 file changed

+34
-0
lines changed
Lines changed: 34 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,34 @@
1+
class Solution {
2+
public:
3+
int dfs(vector<vector<int>>&grid,int i,int j,int n,int m)
4+
{
5+
if(i>=0 and i<n and j>=0 and j<m and grid[i][j]==1)
6+
{
7+
grid[i][j]=0;
8+
return 1+ dfs(grid,i+1,j,n,m)+dfs(grid,i-1,j,n,m)+dfs(grid,i,j+1,n,m)+dfs(grid,i,j-1,n,m);
9+
10+
}
11+
return 0;
12+
}
13+
14+
15+
16+
int maxAreaOfIsland(vector<vector<int>>& grid) {
17+
18+
int max_area=0;
19+
int n=grid.size();
20+
int m=grid[0].size();
21+
for(int i=0;i<n;i++)
22+
{
23+
for(int j=0;j<m;j++)
24+
{
25+
if(grid[i][j]==1)
26+
{
27+
int count=dfs(grid,i,j,n,m);
28+
max_area=max(max_area,count);
29+
}
30+
}
31+
}
32+
return max_area;
33+
}
34+
};

0 commit comments

Comments
 (0)