深度优先搜索dfs
介绍:通过一道算法题引入:LeetCode:200. 岛屿数量题目给你一个由'1'(陆地)和 '0'(水)组成的的二维网格,请你计算网格中岛屿的数量。岛屿总是被水包围,并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。此外,你可以假设该网格的四条边均被水包围。实例1:输入:grid = [ ["1","1","1","1","0"], ["1","1","0","1","0"], ["1","1","0","0","0"], ["0","0...
原创
2022-05-12 20:58:13 ·
121 阅读 ·
0 评论