数据结构-并查集
文章平均质量分 89
STILLxjy
不要让任何人打乱你生活的节奏
展开
-
(POJ 1703) Find them, Catch them【典型并查集:判断在不同的集合】
Find them, Catch themDescription The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the polic转载 2016-12-03 13:42:31 · 667 阅读 · 0 评论 -
(POJ2492)A Bug's Life <并查集判断是否同类>
A Bug’s Life DescriptionBackground Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with原创 2016-12-03 14:27:11 · 547 阅读 · 0 评论 -
(LeetCode 947)移除最多的同行或同列石头 [并查集 + 求解连通分量的个数]
947. 移除最多的同行或同列石头在二维平面上,我们将石头放置在一些整数坐标点上。每个坐标点上最多只能有一块石头。现在,move 操作将会移除与网格上的某一块石头共享一列或一行的一块石头。我们最多能执行多少次 move 操作?示例 1:输入:stones = [[0,0],[0,1],[1,0],[1,2],[2,1],[2,2]]输出:5示例 2:输入:stones = [[0,...原创 2019-02-27 20:19:27 · 603 阅读 · 0 评论