岛屿数量JAVA_算法练习帖--54--岛屿数量(Java)

岛屿数量(DFS、BFS、并查集)

一、题目简介

给你一个由 ‘1’(陆地)和 ‘0’(水)组成的的二维网格，请你计算网格中岛屿的数量。

岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。

此外，你可以假设该网格的四条边均被水包围。

(题目来源：力扣(LeetCode))

示例 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"],

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

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

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

]

输出：3

提示：

m == grid.length

n == grid[i].length

1 <= m, n <= 300

grid[i][j] 的值为 '0' 或 '1'

二、解决方法

1.DFS算法(Depth First Search，深度优先搜索算法)

package com.lxf.graph;

public class DFS {

//小岛数组行长度

private int ir;

//小岛数组列长度

private int ic;

public int numIslands(char[][] grid){

if (grid==null||grid.length==0) {

return 0;

}

//小岛数组行长度赋值

ir=grid.length;

//小岛数组列长度赋值