LeetCode210. Course Schedule II—

LeetCode210. Course Schedule II——拓扑排序

本文主要是介绍LeetCode210. Course Schedule II——拓扑排序，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

文章目录

- 一、题目
- 二、题解

一、题目

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.

For example, the pair [0, 1], indicates that to take course 0 you have to first take course 1.
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.

Example 1:

Input: numCourses = 2, prerequisites = [[1,0]]
Output: [0,1]
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].
Example 2:

Input: numCourses = 4, prerequisites = [[1,0],[2,0],[3,1],[3,2]]
Output: [0,2,1,3]
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.
So one correct course order is [0,1,2,3]. Another correct ordering is [0,2,1,3].
Example 3:

Input: numCourses = 1, prerequisites = []
Output: [0]

Constraints:

1 <= numCourses <= 2000
0 <= prerequisites.length <= numCourses * (numCourses - 1)
prerequisites[i].length == 2
0 <= ai, bi < numCourses
ai != bi
All the pairs [ai, bi] are distinct.

二、题解

class Solution {
public:vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {vector<vector<int>> graph;for(int i = 0;i < numCourses;i++){graph.push_back({});}vector<int> indegree(numCourses,0);for(auto edge:prerequisites){graph[edge[1]].push_back(edge[0]);indegree[edge[0]]++;}vector<int> res;queue<int> q;for(int i = 0;i < indegree.size();i++){if(indegree[i] == 0) q.push(i);}while(!q.empty()){int e = q.front();q.pop();res.push_back(e);int size = graph[e].size();for(int i = 0;i < size;i++){indegree[graph[e][i]]--;if(indegree[graph[e][i]] == 0) q.push(graph[e][i]);}}if(res.size() == numCourses) return res;else return {};}
};