Leetcode 207. Course Schedule

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, is it possible for you to finish all courses?

Example 1:

Input: 2, [[1,0]]
Output: true
Explanation: There are a total of 2 courses to take.
To take course 1 you should have finished course 0. So it is possible.
Example 2:

Input: 2, [[1,0],[0,1]]
Output: false
Explanation: There are a total of 2 courses to take.
To take course 1 you should have finished course 0, and to take course 0 you should
also have finished course 1. So it is impossible.
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.

题目：就是有n门课程，然后有些课是需要先修课的，问最后是不是有一个序列，可以修完所有的课。

解析：其实就是拓扑排序，从入度为0的点开始走，走一次，将另外一个端点的入度减1，看最后能否走完。

代码：

、/*拓扑排序*/

class Solution
{
public:
    bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites)
    {
        if(prerequisites.size()==0) return true;
    	vector<int> indegree(numCourses,0); //计算入度
    	vector<vector<int> > edge; //存边
    	edge.resize(numCourses); //    千万不要给二维分空间
    	int size = prerequisites.size();
    	int cnt = 0;
    	queue<int> Q;
    	for(int i = 0; i < size; i++)
    	{
    		int v = prerequisites[i].first;
    		int u = prerequisites[i].second;
    		indegree[v] ++ ;
    		edge[u].push_back(v);
    	}
    	for(int i = 0; i < numCourses; i++)
    	{
    		if(indegree[i] == 0 )
    		{
    			++cnt;
    			Q.push(i);
    		}
    	}
    	if(cnt==0) return false;
    	else
    	{
    		while(!Q.empty())
    		{
    			int u = Q.front();
    			Q.pop();
    			for(int i = 0 ; i < edge[u].size(); i++)
    			{
    				int v = edge[u][i];
    				cout << u << " " << v <<endl;
    				--indegree[v];
    				if(indegree[v] == 0)
                    {
                        ++cnt;
                        Q.push(v);
                    }
    				if(cnt == numCourses) return true;
    			}
    		}
    	}
    	return false;
    }
};