forked from luliyucoordinate/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
0695.cpp
32 lines (30 loc) · 857 Bytes
/
0695.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
class Solution {
public:
int maxAreaOfIsland(vector<vector<int>>& grid) {
r = grid.size(), c = grid[0].size();
int res = 0;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
if (grid[i][j] == 1) {
grid[i][j] = 0;
res = max(res, dfs(grid, i, j));
}
}
}
return res;
}
private:
int d[5] = {0, 1, 0, -1, 0};
int r, c;
int dfs(vector<vector<int>>& grid, int x, int y) {
int res = 1;
for (int i = 0; i < 4; i++) {
int nx = d[i] + x, ny = d[i + 1] + y;
if (0 <= nx && nx < r && 0 <= ny && ny < c && grid[nx][ny] == 1) {
grid[nx][ny] = 0;
res += dfs(grid, nx, ny);
}
}
return res;
}
};