该博客介绍了如何解决LeetCode694问题，即计算二进制矩阵中不同形状的岛屿数量。通过使用并查集算法，首先合并相连的陆地区域形成岛屿，然后通过平移岛屿并比较其形状来确定独特的岛屿。文章详细解释了如何选择基点平移岛屿，以及如何利用并查集的父节点作为基点进行坐标转换。最后，通过将转换后的岛屿坐标存入集合以消除重复，从而得到独特岛屿的数量。
You are given an m x n binary matrix grid. An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.
An island is considered to be the same as another if and only if one island can be translated (and not rotated or reflected) to equal the other.
Return the number of distinct islands.
Example 1:
Input: grid = [[1,1,0,0,0],[1,1,0,0,0],[0,0,0,1,1],[0,0,0,1,1]] Output: 1
Example 2:
Input:
最低0.47元/天 解锁文章
扫一扫
634
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
