2017年3月7日
LeetCode
摘要： 310. Minimum Height Trees For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree 阅读全文
posted @ 2017-03-07 15:24 揪萌striving 阅读(458) 评论(0) 推荐(0) 编辑