LeetCode200:岛屿数量

最新推荐文章于 2022-09-11 19:37:20 发布

生活甜甜好运连连

最新推荐文章于 2022-09-11 19:37:20 发布

阅读量287

点赞数

分类专栏： note 文章标签：深度优先算法

本文链接：https://blog.csdn.net/RitaAndWakaka/article/details/126428851

版权

note 专栏收录该内容

132 篇文章 1 订阅

订阅专栏

LeetCode200:岛屿数量

给你一个由 '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

示例 2：

输入：grid = [

["1","1","0","0","0"],

["0","0","1","0","0"],

["0","0","0","1","1"]

]

输出：3

关键词：深度优先搜索DFS

思路：挨个扫描二维数组中的元素，当遇到数组中元素为1时进行深度优先搜索。深度优先搜索顺序如下：（当前节点的）左边，右边，上边，下边。同时，每次遍历到一个为1的新位置时要将此位置的1设置为0，防止此新位置被之后的遍历重复遍历到。

代码实现：

class Solution {
    public int numIslands(char[][] grid) {
        if (grid == null || grid[0] == null)    return 0;
        int res = 0;
        for (int i = 0; i < grid.length; ++i) {
            for (int j = 0; j < grid[0].length; ++j) {
                if (grid[i][j] == '1') {
                    res += 1;
                    dfs(grid, i, j);
                }
            }
        }
        return res;
    }
    
    private void dfs(char[][] grid, int i, int j) {
        if (i < 0 || i >= grid.length || j < 0 || j <= grid[0].length || grid[i][j] == '0') {
            return;
        }
        grid[i][j] = '0';
        //左边
        dfs(grid, i, j - 1);
        //右边
        dfs(grid, i, j + 1);
        //上边
        dfs(grid, i - 1, j);
        //下边
        dfs(grid, i + 1, j);
    }
}