目录
深度优先基础概念总结
1.深度优先代码模板(二叉树为例)
def dfs(node):
if node in visited:
#already visited
return
visited.add(node)
#process current node
#logic here
dfs(node.left)
dfs(node.right)
2.符合我们递归思维的深度优先代码模板(多叉树为例)
visited = set()
def dfs(node,visited):
if node in visited:
#terminator # already visited
return
visited.add(node)
#process current node here
for next_node in node.children:
if not next_node in visited:
dfs(next_node,visited)
题目一:岛屿数量
(题目链接:https://leetcode-cn.com/problems/number-of-islands/)
给你一个由 '1'(陆地)和 '0'(水)组成的的二维网格,请你计算网格中岛屿的数量。
岛屿总是被水包围,并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。
此外,你可以假设该网格的四条边均被水包围。
示例 1:
输入:grid = [
["1","1","1","1","0"],
["1","1","0","1","0"],
["1","1","0","0","0"],
["0","0","0","0","0"]
]
输出:1
思路:采用沉岛法活着说是水冲法:遍历整个二维网格,当发现是‘1’的话,就把1自己和它相邻的陆地全部变为0
如何把相邻的也变为0了?采用深度优先进行递归。递归终止条件:要么是超出二维网格范围,要么是遇到水。
**:最终岛屿的数量就是我们两重for遍历二维网格过程中进行深度优先搜索的次数
class Solution {
public int numIslands(char[][] grid) {
if(grid == null ||grid.length ==0){
return 0;
}
int num_island = 0;
int reslut = 0;
int x_length = grid.length;
int y_length = grid[0].length;
for(int r=0;r<x_length;r++){
for(int c = 0;c<y_length;c++){
if(grid[r][c] == '1'){
num_island+=1;
dfs_sink(grid,r,c);
}
}
}
return num_island;
}
public void dfs_sink(char[][] grid, int r,int c){
if(r< 0||r>=grid.length||c<0||c>=grid[0].length||grid[r][c]=='0'){