LintCode 615 课程表 Python题解

最新推荐文章于 2022-05-28 01:26:47 发布

zjy997

最新推荐文章于 2022-05-28 01:26:47 发布

阅读量162

点赞数

分类专栏： LintCode

本文链接：https://blog.csdn.net/zjy997/article/details/104534789

版权

LintCode 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

描述

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: n = 2, prerequisites = [[1,0]] 
Output: true

Example 2:

Input: n = 2, prerequisites = [[1,0],[0,1]] 
Output: false

接触的第一道拓扑排序的题目。参考了九章题解写出了答案，对该知识点仍然有一些不够清晰的地方，相关题目下次可以继续练习。

from collections import deque

class Solution:
    """
    @param: numCourses: a total of n courses
    @param: prerequisites: a list of prerequisite pairs
    @return: true if can finish all courses or false
    """
    def canFinish(self, numCourses, prerequisites):
        # write your code here
        queue = deque([])
        edges = {i:[]for i in range(numCourses)}#出度
        degrees = [0 for i in range(numCourses)]#入度
        for i,j in prerequisites:
            edges[j].append(i)
            degrees[i] += 1 
        for i in range(numCourses):
            if(degrees[i] == 0):
                queue.append(i)
                
        while(queue):
            node = queue.popleft()
            for i in edges[node]:
                degrees[i] -= 1
                if(degrees[i] == 0 ):
                    queue.append(i)
                
        if(degrees == [0 for i in range(numCourses)]):#所有点的入度为零时，即能到达所有点
            return True
        else:
            return False