/*
* @lc app=leetcode.cn id=695 lang=javascript
*
* [695] 岛屿的最大面积
*/
// @lc code=start
/**
* @param {number[][]} grid
* @return {number}
*/
var maxAreaOfIsland = function (grid) {
let result = 0
for (let row = 0
for (let col = 0
if (grid[row][col] === 1) {
const count = dfs(row, col)
// 比较多个岛的面积大小
result = Math.max(result, count)
}
}
}
function dfs(row, col) {
// 判断边界值
if (
row < 0 ||
row >= grid.length ||
col < 0 ||
col >= grid[0].length ||
grid[row][col] === 0
) {
return 0
}
grid[row][col] = 0
// 定义一个变量为1
let count = 1
// 上下左右累加
count += dfs(row - 1, col)
count += dfs(row + 1, col)
count += dfs(row, col - 1)
count += dfs(row, col + 1)
return count
}
return result
}
// @lc code=end