【文件属性】：
文件名称：leetcode不会-LeetCode_Summary:力扣_总结
文件大小：104KB
文件格式：ZIP
更新时间：2021-06-30 03:29:27
系统开源
leetcode
不会
LeetCode_Summary
A;
Abc
abc
abc
B：
Bcd
acd
def
Since
two
trees
are
not
on
the
same
root,
connect
the
A
to
B
Then
we
would
have
to
union
them
by
using
union-find.
The
resulting
Set
would
be
since
abc->
{bcd,
acd,
def}
The
size
would
get
updated
as
1
1
1
Abc
abc
abc
1
1
1
Bcd
acd
def
1
2
2
2
Abc
bcd
acd
def
And
abc
itself
is
the
father
node
so
the
largest
set
is
the
set
with
all
books.
431
{1,2,4#2,1,4#3,5#4,1,2#5,3}
1------2
\
|
\
|
\
----4
3
|
|
5
假设x是要找的节点label,
那么
先判断x是否在father
map
【文件预览】：
LeetCode_Summary-master
----README.md(300KB)