https://leetcode.cn/problems/max-area-of-island/
class Solution {
public:
int maxArea;
constexpr static int dxi[4] = {1, 0, -1, 0};
constexpr static int dyi[4] = {0, 1, 0, -1};
public:
void dfs(vector<vector<int>>& grid, int dx, int dy, int& curArea) {
if (dx<0 || dx>=grid.size() || dy<0 || dy>=grid[0].size() || grid[dx][dy]==0) return;
if (grid[dx][dy] == 1) {
++curArea;
maxArea = max(maxArea, curArea);
grid[dx][dy] = 0;
for(int i=0;i<4;i++) {
dfs(grid, dx+dxi[i], dy+dyi[i], curArea);
}
}
}
int maxAreaOfIsland(vector<vector<int>>& grid) {
int n = grid.size();
int m = grid[0].size();
for(int i=0;i<n;++i) {
for(int j=0;j<m;++j) {
if (grid[i][j] == 1) {
int size = 0;
dfs(grid, i, j, size);
}
}
}
}
};