LeetCode711. Number of Distinct Islands II - - 彻底掌握并查集（Union Find）系列题8

最新推荐文章于 2024-11-04 10:51:20 发布

CP Coding

最新推荐文章于 2024-11-04 10:51:20 发布

阅读量260

点赞数 1

分类专栏： Leetcode刷题笔记并查集Union Find 文章标签： python leetcode 算法数据结构

本文链接：https://blog.csdn.net/hgq522/article/details/121620573

版权

这道LeetCode难题要求计算经过旋转和镜像后形状相同的岛屿数量。通过使用并查集(Union Find)模板，可以解决找出不同岛屿的问题。关键在于处理岛屿的旋转和镜像，将所有可能的情况考虑在内，包括0度、90度、180度、270度旋转和四种镜像。通过对每个岛屿进行这些变换，生成8组坐标集合，然后比较它们是否相同，从而确定岛屿的个数。

摘要由CSDN通过智能技术生成

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 they have the same shape, or have the same shape after rotation (90, 180, or 270 degrees only) or reflection (left/right direction or up/down direction).

Return the number of distinct islands.

Example 1:

Input: grid = [[1,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,1]]
Output: 1
Explanation: The two islands are considered the same because if we make a 180 degrees clockwise ro