← 返回 snowflake 的题目列表Course Scheduling
类型：online_judge
Given a directed graph representing courses and prerequisites, determine if all courses can be completed. Example test cases:
Input: numCourses = 2, prerequisites = [[1,0]]
Output: True
Explanation: Directed graph: 0 -> 1, all courses can be completed.
Input: numCourses = 2, prerequisites = [[1,0],[0,1]]
Output: False
Explanation: The graph forms a cycle, so not all courses can be completed.
Example
Input
2
[[1,0]]