There are a total of
numCourses
courses you have to take, labeled from0
tonumCourses-1
.
Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair:[0,1]
Given the total number of courses and a list of prerequisite pairs, is it possible for you to finish all courses?
Constraints:
- The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
- You may assume that there are no duplicate edges in the input prerequisites.
1 <= numCourses <= 10^5
你選了總共
numCourses
堂的課程,將它們標記為0
到numCourses-1
。
有些課程有擋修,例如你需要先修課程 1 才能修課程 0 ,這被表示成一個對子:[0,1]
給予課程的總數和一個擋修表,判斷是否可能完成所有課程。
限制:
- 輸入的擋修表使用邊的列表(list of edges)表示法,而不是鄰近矩陣(adjacency matrices),查閱更多圖的表示法來得到更多相關知識。
- 你可以假設擋修表不會有重複的邊。
1 <= numCourses <= 10^5
16、17
章喔~LeetCode
C++