版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u013596119/article/details/85125800
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, return the ordering of courses you should take to finish all courses.
There may be multiple correct orders, you just need to return one of them. If it is impossible to finish all courses, return an empty array.
Example 1:
Input: 2, [[1,0]] Output:[0,1]Explanation: There are a total of 2 courses to take. To take course 1 you should have finished course 0. So the correct course order is[0,1] .
Example 2:
Input: 4, [[1,0],[2,0],[3,1],[3,2]] Output:[0,1,2,3] or [0,2,1,3]Explanation: There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0. So one correct course order is[0,1,2,3]. Another correct ordering is[0,2,1,3] .
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.
Answer:
from collections import defaultdict
class Solution(object):
def findOrder(self, numCourses, prerequisites):
"""
:type numCourses: int
:type prerequisites: List[List[int]]
:rtype: List[int]
"""
indegree=[0]*numCourses
graph=defaultdict(list)
for p in prerequisites:
graph[p[1]].append(p[0])
indegree[p[0]]+=1
L=[]
S=set()
for i in range(numCourses):
if indegree[i]==0:
S.add(i)
while S:
node=S.pop()
#print node
L.append(node)
tmpl=list(graph[node])
del graph[node]
for k in tmpl:
indegree[k]-=1
if indegree[k]==0:
S.add(k)
if len(graph.keys())!=0:
return []
return L
Topological sorting:
https://en.wikipedia.org/wiki/Topological_sorting
Kahn's Algorithm
扫描二维码关注公众号，回复：
4591160 查看本文章
https://www.geeksforgeeks.org/topological-sorting-indegree-based-solution/
利用一个数组保存每个节点进入edge的数量