![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图
文章平均质量分 78
sscssz
这个作者很懒,什么都没留下…
展开
-
【VIP】【图】332. Reconstruct Itinerary【M】【47】
Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus,原创 2016-03-29 19:44:09 · 436 阅读 · 0 评论 -
207. Course Schedule My SubmissionsQuestionEditorial Solution【M】【48】【vip】【再来一遍】
There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a原创 2016-05-26 13:30:45 · 365 阅读 · 0 评论 -
210. Course Schedule II【M】【7】
There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as原创 2016-05-26 13:41:43 · 545 阅读 · 0 评论 -
310. Minimum Height Trees【M】【37】
For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called mini原创 2016-05-27 09:27:20 · 464 阅读 · 0 评论 -
133. Clone Graph【M】【73】【图的遍历】【再来一遍】【vip】
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled uniquely. We use # as a separator for each原创 2016-05-27 12:33:09 · 441 阅读 · 0 评论