深度优先遍历
Depth-First Search Visualization (usfca.edu)
695. 岛屿的最大面积 题解 - 力扣(LeetCode) (leetcode-cn.com)
原理:从起始点开始遍历周围的一个点,再从该个点遍历到周围某一个未遍历的点,直到所有遍历过的点都遍历完标记为0,停止遍历
比如:二叉树遍历到某一个节点都随便找一个分支进行遍历
public int maxAreaOfIsland(int[][] grid) {
int ans = 0;
for (int i = 0; i != grid.length; ++i) {
for (int j = 0; j != grid[0].length; ++j) {
if(grid[i][j]==1){
ans = Math.max(ans, dfs(grid, i, j));
}
}
}
return ans;
}
public static int dfs(int[][] grid, int cur_i, int cur_j) {
if (cur_i < 0 || cur_j < 0 || cur_i == grid.length || cur_j == grid[0].length || grid[cur_i][cur_j] != 1) {
return 0;//筛选边界的和结果不为1的不要
}
grid[cur_i][cur_j] = 0;//遍历过的,将值变为0
int[] di = {0, 0, 1, -1};//上下
int[] dj = {1, -1, 0, 0};//左右
int ans = 1;
for (int index = 0; index != 4; ++index) {//四个方向
int next_i = cur_i + di[index], next_j = cur_j + dj[index];
ans += dfs(grid,next_i, next_j);//深度遍历 一个一个搞
}
return ans;
}