685. Redundant Connection II
目前为止。leetcode中的tree题里面最绕的一个题了,和图产生关系的都感觉不简单。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, p...
原创
2018-07-08 16:08:50 ·
222 阅读 ·
0 评论