
Topological Sort
文章平均质量分 87
zshouyi
这个作者很懒,什么都没留下…
展开
-
207. Course Schedule
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原创 2017-06-05 09:01:01 · 263 阅读 · 0 评论 -
210. Course Schedule II
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原创 2017-06-06 09:27:00 · 316 阅读 · 0 评论 -
444. Sequence Reconstruction
Check whether the original sequence org can be uniquely reconstructed from the sequences in seqs. The org sequence is a permutation of the integers from 1 to n, with 1 ≤ n ≤ 104. Reconstruction me原创 2017-06-15 12:16:15 · 1014 阅读 · 0 评论