210. Course Schedule II Medium
1/**
2 * [210] Course Schedule II
3 *
4 * There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai.
5 *
6 * For example, the pair [0, 1], indicates that to take course 0 you have to first take course 1.
7 *
8 * Return the ordering of courses you should take to finish all courses. If there are many valid answers, return any of them. If it is impossible to finish all courses, return an empty array.
9 *
10 * Example 1:
11 *
12 * Input: numCourses = 2, prerequisites = [[1,0]]
13 * Output: [0,1]
14 * Explanation: There are a total of 2 courses to take. To take course 1 you should have finished course 0. So the correct course order is [0,1].
15 *
16 * Example 2:
17 *
18 * Input: numCourses = 4, prerequisites = [[1,0],[2,0],[3,1],[3,2]]
19 * Output: [0,2,1,3]
20 * Explanation: There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0.
21 * So one correct course order is [0,1,2,3]. Another correct ordering is [0,2,1,3].
22 *
23 * Example 3:
24 *
25 * Input: numCourses = 1, prerequisites = []
26 * Output: [0]
27 *
28 *
29 * Constraints:
30 *
31 * 1 <= numCourses <= 2000
32 * 0 <= prerequisites.length <= numCourses * (numCourses - 1)
33 * prerequisites[i].length == 2
34 * 0 <= ai, bi < numCourses
35 * ai != bi
36 * All the pairs [ai, bi] are distinct.
37 *
38 */
39pub struct Solution {}
40
41// problem: https://leetcode.com/problems/course-schedule-ii/
42// discuss: https://leetcode.com/problems/course-schedule-ii/discuss/?currentPage=1&orderBy=most_votes&query=
43
44// submission codes start here
45
46impl Solution {
47 pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
48 vec![]
49 }
50}
51
52// submission codes end
53
54#[cfg(test)]
55mod tests {
56 use super::*;
57
58 #[test]
59 fn test_210() {
60 }
61}
62
Back
© 2025 bowen.ge All Rights Reserved.