有n门课程，编号为0到n - 1。给定某些课程的前后置关系(i, j)（表示完成课程i必须先完成课程j），求任意完成课程的顺序。 解法 这道题是拓扑排序，可以使用类似BFS的方法。首先将所有入度为0的节点加入队列；在每一次循环中，弹出队列的第一个元素，将其 ...

There are n different online courses numbered from 1 to n. Each course has some duration (course length) t and closed on dth day. A course should be taken continuously for t days and must be finished ...