LeetCode 695. 岛屿的最大面积
题目描述
思路分析
感染
参考代码
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
func maxAreaOfIsland(grid [][]int) int {
if len(grid) == 0 || len(grid[0]) == 0 {
return 0
}
maxArea := 0
for i := 0; i < len(grid); i++ {
for j := 0; j < len(grid[0]); j++ {
if grid[i][j] == 1 {
area := dfs(grid, i, j)
maxArea = max(maxArea, area)
}
}
}
return maxArea
}
func dfs(grid [][]int, row, col int) int {
if row < 0 || row >= len(grid) || col < 0 || col >= len(grid[0]) || grid[row][col] != 1 {
return 0
}
// 将当前位置标记为已访问
grid[row][col] = 0
// 递归搜索相邻的岛屿
area := 1
area += dfs(grid, row+1, col)
area += dfs(grid, row-1, col)
area += dfs(grid, row, col+1)
area += dfs(grid, row, col-1)
return area
}
func max(a, b int) int {
if a > b {
return a
}
return b
}
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
class Solution {
public int maxAreaOfIsland(int[][] grid) {
int m = grid.length;
int n = grid[0].length;
int res = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid[i][j] == 1) {
int area = dfs(grid, i, j);
res = Math.max(res, area);
}
}
}
return res;
}
public int dfs(int[][] grid, int i, int j) {
if (i < 0 || i >= grid.length || j < 0 || j >= grid[0].length || grid[i][j] != 1) {
return 0;
}
grid[i][j] = 2;
int area = 1;
area += dfs(grid, i - 1, j);
area += dfs(grid, i + 1, j);
area += dfs(grid, i, j - 1);
area += dfs(grid, i, j + 1);
return area;
}
}
相似题目
题目 | 难度 | 题解 |
---|---|---|
岛屿数量 | Medium | |
岛屿的周长 | Easy |
CC BY-NC-SA 4.0
许可协议,转载请注明出处!
本博客所有文章除特别声明外,均采用