Leetcode 210. Course Schedule II 拓扑排序

最新推荐文章于 2019-07-17 14:16:59 发布

FBI-PC

最新推荐文章于 2019-07-17 14:16:59 发布

阅读量173

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/u014303647/article/details/89283642

版权

Leetcode 专栏收录该内容

55 篇文章 0 订阅

订阅专栏

Course Schedule II
Medium

837

Favorite

Share
There are a total of n courses you have to take, labeled from 0 to n-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, return the ordering of courses you should take to finish all courses.

There may be multiple correct orders, you just need to return one of them. If it is impossible to finish all courses, return an empty array.

Example 1:

Input: 2, [[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: 4, [[1,0],[2,0],[3,1],[3,2]]
Output: [0,1,2,3] or [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] .
Note:

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.

题目意思：就是给一些先修可能，然后给出最后的一个修课顺序，如果不存在，那么返回0。

解析：就是一个典型的topsort题目，最后要判断我们已经存了多少个入度为0的点，根据这个判断是否存在合法的序列。

代码：

class Solution 
{
public:
    vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) 
    {
    	vector<int> ans;
    	vector<int> indegree(numCourses, 0);
    	vector<vector<int>> edge(numCourses);
    	int size = prerequisites.size();
    	for(int i = 0; i < size; i++)
    	{
    		pair<int, int> tmp = prerequisites[i];
    		int u = tmp.second;
    		int v = tmp.first;
    		++indegree[v];
    		edge[u].push_back(v);
    	}
    	queue<int> Q;
    	for(int i = 0; i < numCourses; i++)
    		if(indegree[i] == 0) Q.push(i);
    	while(!Q.empty())
    	{
    		int u = Q.front();
    		ans.push_back(u);
    		Q.pop();
    		for(int i = 0; i < edge[u].size(); i++)
    		{
    			int v = edge[u][i];
    			--indegree[v];
    			if(indegree[v]==0) Q.push(v);
    		}
    	}
    	vector<int> ans1;
    	return ans.size()==numCourses ? ans : ans1;
    }
};