LeetCode之并查集
黄焖鸡米饭啊
嗯。
展开
-
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 exactly one parent原创 2017-12-15 11:26:40 · 368 阅读 · 2 评论 -
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 a原创 2017-12-12 15:03:15 · 237 阅读 · 0 评论