2018年2月12日
[LeetCode] 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 n 阅读全文
posted @ 2018-02-12 22:29 Grandyang 阅读(9925) 评论(10) 推荐(0)
Fork me on GitHub