一、题目
二、题解
枚举每一个岛屿,枚举过的岛屿修改为1减少dfs次数
class Solution {
public:
int dx[4]{1, -1, 0, 0}, dy[4]{0, 0, 1, -1}, res, n, m, path;
void dfs(int i, int j, vector<vector<int>>& g) {
path++;
res = max(res, path);
g[i][j] = 0;
for (int k = 0; k < 4; k++)
if (i + dx[k] >= 0 && i + dx[k] < n && j + dy[k] >= 0 && j + dy[k] < m && g[i + dx[k]][j + dy[k]] != 0)
dfs(i + dx[k], j + dy[k], g);
}
int maxAreaOfIsland(vector<vector<int>>& grid) {
n = grid.size(), m = grid[0].size(), res = 0, path = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
path = 0;
if (grid[i][j] != 0)
dfs(i, j, grid);
}
return res;
}
};