leetcode刷题笔记(Golang)--200. Number of Islands

最新推荐文章于 2021-07-03 14:29:57 发布

原创最新推荐文章于 2021-07-03 14:29:57 发布 · 207 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode #dfs #算法 #golang

收录于

leetcode刷题笔记(Golang) 专栏收录该内容

172 篇文章

订阅专栏

本文深入探讨了计算二维网格中岛屿数量的算法。通过遍历地图并利用深度优先搜索(DFS)来标记和计数岛屿，提供了详细的代码实现及示例说明。

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 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
00000

Output: 1
Example 2:

Input:
11000
11000
00100
00011

Output: 3

花花酱

func numIslands(grid [][]byte) int {
	if len(grid) == 0 {
		return 0
	}
	res := 0
	m, n := len(grid), len(grid[0])
	for i := 0; i < m; i++ {
		for j := 0; j < n; j++ {
			res += int(grid[i][j]) - '0'
			dfs(grid, i, j, m, n)
		}
	}
    return res
}

func dfs(graph [][]byte, i int, j int, m int, n int) {
	if i < 0 || i >= m || j < 0 || j >= n || graph[i][j] == '0' {
		return
	}
	graph[i][j] = '0'
	dfs(graph, i+1, j, m, n)
	dfs(graph, i-1, j, m, n)
	dfs(graph, i, j+1, m, n)
	dfs(graph, i, j-1, m, n)
}