说明

算法：Number of Islands
LeetCode地址：https://leetcode.com/problems/number-of-islands/

题目：
Given a 2d grid map of '1’s (land) and '0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Example 1:

Input:
11110
11010
11000
00000Output: 1

Example 2:

Input:
11000
11000
00100
00011Output: 3

解题思路

问题类型：图的深度优先搜索算法。
求岛屿的个数，实际为上下左右连通的图的个数。题目给出了数目条件为’1’，实际还有一个隐含条件，就是连在一起的’1’，表示已经被访问过。
标志为新岛屿的充分必要条件就变成了 grid[row][column] == '1' && visitArray[row][column] == false

时间复杂度为 O(rowcolumn) , 标志是否已经访问过得子方法 markConnectIsland ，时间复杂度为O(rowcolumn), 也就是均摊为每个数据都访问一次，也就是跟父方法 numIslands 时间复杂度一样。

代码实现

import java.util.Arrays;public class NumberOfIslands {public int numIslands(char[][] grid) {if (grid == null || grid.length == 0 || grid[0].length == 0) {return 0;}int count = 0;int rowLen = grid.length;int columnLen = grid[0].length;boolean[][] visitArray = new boolean[rowLen][columnLen];for (int row = 0; row < rowLen; row++) {for (int column = 0; column < columnLen; column++) {if (grid[row][column] == '1' && visitArray[row][column] == false) {markConnectIsland(grid, visitArray, row, column);count++;}}}return count;}private void markConnectIsland(char[][] grid, boolean[][] visitArray, int row, int column) {if (row < 0 || row >= grid.length) return;if (column < 0 || column >= grid[0].length) return;if (grid[row][column] != '1' || visitArray[row][column]) return;visitArray[row][column] = true;markConnectIsland(grid, visitArray, row + 1, column);markConnectIsland(grid, visitArray, row - 1, column);markConnectIsland(grid, visitArray, row, column + 1);markConnectIsland(grid, visitArray, row, column - 1);}public static void main(String[] args) {//char[][] grid = {//                    {'1', '1', '1', '1', '0'},//                    {'1', '1', '0', '1', '0'},//                    {'1', '1', '0', '0', '0'},//                    {'0', '0', '0', '0', '0'}//                };char[][] grid = {{'1', '1', '0', '0', '0'},{'1', '1', '0', '0', '0'},{'0', '0', '1', '0', '0'},{'0', '0', '0', '1', '1'}};int count = new NumberOfIslands().numIslands(grid);System.out.println("input: " + Arrays.toString(grid) + "\nOutput:" + count );}
}

运行结果

input: [[C@610455d6, [C@511d50c0, [C@60e53b93, [C@5e2de80c]
Output:3

代码执行效率

Runtime: 5 ms, faster than 37.70% of Java online submissions for Number of Islands.
Memory Usage: 39.9 MB, less than 78.00% of Java online submissions for Number of Islands.

总结

图的深度优先搜索。

代码下载：
https://github.com/zgpeace/awesome-java-leetcode/blob/master/code/LeetCode/src/popular/NumberOfIslands.java

算法:Number of Islands(岛屿的个数)相关推荐

lintcode：Number of Islands 岛屿的个数
题目: 岛屿的个数给一个01矩阵,求不同的岛屿的个数. 0代表海,1代表岛,如果两个1相邻,那么这两个1属于同一个岛.我们只考虑上下左右为相邻. 样例在矩阵: [[1, 1, 0, 0, 0],[ ...
200. Number of Islands**(岛屿数量)
200. Number of Islands**(岛屿数量) https://leetcode.com/problems/number-of-islands/ 题目描述 Given an m x n ...
【算法python实现】 -- 岛屿的个数
原题: https://leetcode-cn.com/problems/number-of-islands/ 思路深度优先遍历从顶点开始,到其相邻的一个节点,再由此节点至其相邻的节点,依次遍历所 ...
岛屿的个数java_LeetCode 200：岛屿数量 Number of Islands
题目: 给定一个由 '1'(陆地)和 '0'(水)组成的的二维网格,计算岛屿的数量.一个岛被水包围,并且它是通过水平方向或垂直方向上相邻的陆地连接而成的.你可以假设网格的四个边均被水包围. Given ...
LintCode 433. 岛屿的个数 JavaScript算法
描述给一个 01 矩阵,求不同的岛屿的个数. 0 代表海,1 代表岛,如果两个 1 相邻,那么这两个 1 属于同一个岛.我们只考虑上下左右为相邻. 样例 - 样例 1:输入: [[1,1,0,0,0 ...
【LeetCode 剑指offer刷题】回溯法与暴力枚举法题6：Number of Islands
[LeetCode & 剑指offer 刷题笔记]目录(持续更新中...) Number of Islands Given a 2d grid map of '1's (land) and ' ...
LeetCode 200. Number of Islands
Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surro ...
【Leetcode】Number of Islands
题目链接:https://leetcode.com/problems/number-of-islands/ 题目: Given a 2d grid map of '1's (land) and '0' ...
灰狼算法优化LSTM超参数-神经元个数-dropout-batch_size
1.摘要本文主要讲解:使用灰狼算法优化LSTM超参数-神经元个数-dropout-batch_size 主要思路: 灰狼算法 Parameters : 迭代次数.狼的寻值范围.狼的数量 LSTM P ...
305. Number of Islands II
305. Number of Islands II 方法1: Union Find 易错点: Complexity 方法2: dfs Complexity A 2d grid map of m row ...

算法:Number of Islands(岛屿的个数)

说明

解题思路

代码实现

运行结果

代码执行效率

总结

算法:Number of Islands(岛屿的个数)相关推荐

最新文章

热门文章