← 返回 amazon 的题目列表Course Schedule Problem
类型：online_judge
Given a list of courses and a list of prerequisite pairs, determine if it is possible to finish all courses.
Input:
An integer numCourses representing the number of courses.
A 2D integer array prerequisites, where each element is a prerequisite pair [a, b], indicating course b is a prerequisite for course a.
Output:
A boolean indicating whether it is possible to complete all course arrangements.
Example:
Input: numCourses = 2, prerequisites = [[1, 0]] Output: true
Input: numCourses = 2, prerequisites = [[1, 0], [0, 1]] Output: false
Constraints:
1 <= numCourses <= 10^5
0 <= prerequisites.length <= 5000
Example
Input
2
[[1,0]]