-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path695. Max Area of Island.cpp
43 lines (40 loc) · 1.2 KB
/
695. Max Area of Island.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
/*
Problem Link: https://leetcode.com/problems/max-area-of-island/
Time: 28 ms (Beats 39.38%), Space: 24 MB (Beats 39.73%)
*/
class Solution {
private:
int dfs(int row, int col, vector<vector<int>>& vis, vector<vector<int>>& grid, int& cnt){
vis[row][col]=1;
int n= grid.size();
int m= grid[0].size();
int dr[] = {-1, 0, +1, 0};
int dc[] = {0, 1, 0, -1};
cnt++;
for(int i=0; i<4; i++){
int nrow= row+dr[i];
int ncol= col+dc[i];
if(nrow>=0 && nrow<n && ncol<m && ncol>=0 && grid[nrow][ncol]==1 && !vis[nrow][ncol]){
dfs(nrow, ncol, vis, grid, cnt);
}
}
return cnt;
}
public:
int maxAreaOfIsland(vector<vector<int>>& grid) {
int n= grid.size();
int m= grid[0].size();
vector<vector<int>> vis(n, vector<int> (m, 0));
int mx=0, cnt=0;
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
if(!vis[i][j] && grid[i][j]==1){
dfs(i, j, vis, grid, cnt);
mx= max(mx, cnt);
cnt= 0;
}
}
}
return mx;
}
};