2020年2月25日
LeetCode 685. Redundant Connection II 冗余连接 II (C++/Java)
摘要： 题目： 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 th 阅读全文
posted @ 2020-02-25 14:52 silentteller 阅读(245) 评论(0) 推荐(0) 编辑