![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
union-find
hling_so
这个作者很懒,什么都没留下…
展开
-
684. Redundant Connection
问题描述In this problem, a tree is an undirected graph that is connected and has no cycles.The given input is a graph that started as a tree with N nodes (with distinct values 1, 2, …, N), with one additio原创 2017-10-26 21:31:38 · 160 阅读 · 0 评论 -
685. Redundant Connection II
问题描述 题意理解 算法分析 具体实现问题描述In this problem, a rooted tree is a directed graph such that, there is exactly one node (the root) for which all other nodes are descendants of this node, plus every node has exa原创 2017-10-27 22:03:47 · 370 阅读 · 0 评论