这篇博客介绍了如何使用并查集解决LeetCode中的305题——Number of Islands II。文章详细解释了如何将二维数组转换为一维，并通过并查集算法，跟踪每个操作后岛屿的数量。在每次addLand操作时，会检查新陆地是否与现有岛屿相邻，若相邻则合并岛屿，调整岛屿计数。博客提供了问题的解决方案和思路。
题目链接: https://leetcode.com/problems/number-of-islands-ii/
A 2d grid map of m rows and n columns is initially filled with water. We may perform an addLand operation which turns the water at position (row, col) into a land. Given a list of positions to operate, count the number of islands after each addLand operation. 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:
Given
最低0.47元/天 解锁文章
扫一扫
1047
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
