forked from itcharge/LeetCode-Py
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
23 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,23 @@ | ||
## 1. 并查集简介 | ||
|
||
### 1.1 并查集的定义 | ||
|
||
> **并查集(Union Find)**:直译为不交集数据结构(Disjoint-set Data Structure)。是一种树形的数据结构,用于处理一些不交集(一系列没有重复元素的集合)的合并及查询问题。并查集主要支持两种操作: | ||
> | ||
> - **查找(Find)**:确定某个元素属于哪个集合。 | ||
> - **合并(Union)**:将两个集合合并成一个集合。 | ||
### 1.2 并查集的原理 | ||
|
||
## 2. 路径压缩 | ||
|
||
## 3. 按秩合并 | ||
|
||
## 4. 并查集的应用 | ||
|
||
## 参考资料 | ||
|
||
- 【博文】[并查集 - OI Wiki](https://oi-wiki.org/ds/dsu/) | ||
- 【书籍】算法竞赛入门经典:训练指南 - 刘汝佳,陈锋 著 | ||
- 【书籍】算法竞赛进阶指南 - 李煜东 著 | ||
- 【书籍】【书籍】算法训练营 陈小玉 著 |