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?

For example:

2, [[1,0]]

There are a total of 2 courses to take. To take course 1 you should have finished course 0. So it is possible.

2, [[1,0],[0,1]]

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.

class Solution 
{
public:
    bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) 
    {
        if(prerequisites.size()<=1)
            return true;
        //拓扑排序
        map<int,vector<int>> graph;       //<课程a,<先修课程为a的课程>>
        vector<int> pre(numCourses,0);    //统计每一门课程,先修课程的数目
        for(int i=0;i<prerequisites.size();i++)
        {
            pre[prerequisites[i].first]++;
            graph[prerequisites[i].second].push_back(prerequisites[i].first);
        }
        
        queue<int> q; //存储当前入度为0的点
        for(int i=0;i<numCourses;i++)
        {
            if(pre[i]==0)
                q.push(i);
        }
        
        while(!q.empty())
        {
           //消除一个无先修课程的的课
           int temp=q.front();
           q.pop();
           vector<int> v;
           auto it=graph.find(temp);
           if(it!=graph.end())
                 v=it->second;
           for(int i=0;i<v.size();i++)
           {
               pre[v[i]]--;
               if(pre[v[i]]==0)
                q.push(v[i]);
           }
        }
        for(int i=0;i<numCourses;i++)
        {
            if(pre[i])
                return false;
        }
        return true;
    }
};