【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. Read more about how a graph is represented.

click to show more hints.

Hints:

1. This problem is equivalent to finding if a cycle exists in a directed graph. If a cycle exists, no topological ordering exists and therefore it will be impossible to take all courses.
2. Topological Sort via DFS - A great video tutorial (21 minutes) on Coursera explaining the basic concepts of Topological Sort.
3. Topological sort could also be done via BFS. 

参考：

http://yucoding.blogspot.jp/2015/06/leetcode-question-course-schedule.html

https://www.youtube.com/watch?v=zLZhSSXAwxI

将度为0的节点弹出，每弹一个，计数一个

当最后的计数小于n时，说明遇到了环

class Solution(object):
    def canFinish(self, numCourses, prerequisites):
        """
        :type numCourses: int
        :type prerequisites: List[List[int]]
        :rtype: bool
        """
        
        map=[[] for i in range(numCourses)]      #存每个节点的in点
        ind=[0 for i in range(numCourses)]       #存每个节点的out点数
        
        for p in prerequisites:
            if p[0] not in map[p[1]]:
                map[p[1]].append(p[0])
                ind[p[0]]+=1
            
        tail=[]                                  #只存0度的节点
        for i in range(numCourses):
            if ind[i]==0:
                tail.append(i)
                
        
        count=0
        
        while tail:
            tmp=tail[0]
            tail.pop(0)                          #弹出0度的节点，数字加1
            count+=1
            for i in map[tmp]:                   #与弹出的节点相连的点，度都－1
                ind[i]-=1
                if ind[i]==0:                    #将度为0的节点存起来
                    tail.append(i)
        
        if count<numCourses:
            return False
        else:
            return True