【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?

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.

Note:
The input prerequisites is a graph represented by a list of edges, not adjacency matrices.

分析：
这道题可以理解成判断一个有向图是否有环。可以通过拓扑排序来实现。射一个变量count来记录进入过队列的结点，若count等于结点数，则表示该有向图没有环。
代码：

class Solution {
public:

    bool canFinish(int numCourses, vector<pair<int, int> >& prerequisites) {
        int* indegree = new int[numCourses];
        queue<int> q;
        for(int i = 0;i<numCourses;i++)
        indegree[i]= 0;
        int ss;
        for(int i = 0;i<prerequisites.size();i++)
        {
            ss = prerequisites[i].second;
            indegree[ss]++;
        }
        int count = 0;
        for(int i = 0;i<numCourses;i++)
        {
            if(indegree[i] == 0)
            {
                q.push(i);
                count++;
            }

        }

        while(!q.empty())
        { 
            int temp = q.front();
            q.pop();
            for(int i = 0;i< prerequisites.size();i++)
            {
                if(temp == prerequisites[i].first)
                {
                    ss = prerequisites[i].second;
                    indegree[ss]--;
                    if(indegree[ss] == 0)
                    {
                        q.push(ss);
                        count++;
                    }


                }
            }
        }
        if(count == numCourses)
        return true;
        else return false;

    }


};