该博客讨论了LeetCode 1136问题，涉及如何使用拓扑排序算法解决确定最少学期数完成所有课程的需求。文章解释了如何通过BFS策略确保每学期修读尽可能多的课程，并确保所有先决条件得到满足。
You are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also given an array relations where relations[i] = [prevCoursei, nextCoursei], representing a prerequisite relationship between course prevCoursei and course nextCoursei: course prevCoursei has to be taken before course nextCoursei.
In one semester, you can take any number of courses as long as you have taken all the prerequisites in the previous semester for the courses you are taking.
Return the minimum number of semesters needed to take all courses. If there is no way to take all the courses, return -1.
Example 1:
最低0.47元/天 解锁文章
590
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
