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.
分析，可以根据图的方法来解决这个问题， 如果课程B依赖A，A->B, 那就把课程B的入度+1，且用一个数组保存每个依赖该点的所有点， 最开始找出入度为0的点(如果找不出，且还有很多点没有visit， return false), 然后把该点置为visit， 然后把依赖该点的所有点的入度减1， 这样一直循环下去，直到所有点都可以被visit, return true , 否则，return false. 代码如下：

def canFinish(self, numCourses, prerequisites):
        """
        :type numCourses: int
        :type prerequisites: List[List[int]]
        :rtype: bool
        """
        if len(prerequisites)==0:
            return True
        elif len(prerequisites)==1:
            if prerequisites[0][0]==prerequisites[0][1]:
                return False
            else:
                return True
        graph=[[] for i in range(numCourses)]
        inDegree=[0 for i in range(numCourses)]
        for i in range(len(prerequisites)):
            graph[prerequisites[i][1]].append(prerequisites[i][0])
            inDegree[prerequisites[i][0]]+=1
        visited=[0 for i in range(numCourses)]
        j=0
        for i in range(numCourses):
            for j in range(numCourses):
                if inDegree[j]==0 and visited[j]==0:
                    break
            if j==numCourses-1 and (inDegree[j]>0 or visited[j]==1):
                return False
            visited[j]=1
            for k in graph[j]:
                inDegree[k]-=1
        return True