題目出處
難度
medium
題目分類
Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort
2026-07-30 二刷
個人範例程式碼 - 二刷 (2026/07/30)
from collections import defaultdict
class Solution:
def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:
graph = defaultdict(list)
in_degree = [0]* numCourses # all courses with its prev courses
for curr, prev in prerequisites:
graph[prev].append(curr)
in_degree[curr] += 1
curr_course = []
for i in range(numCourses):
if in_degree[i] == 0:
curr_course.append(i)
while curr_course:
next_course = []
for course in curr_course:
numCourses -= 1
for nxt in graph[course]:
in_degree[nxt] -= 1
if in_degree[nxt] == 0:
next_course.append(nxt)
curr_course = next_course
return False if numCourses else True
算法說明
拓樸排序法,透過 in_degree 計算已經可以上的課程 (還不能上的會非 0,表示有被擋修)
另外透過 graph 建立 prev -> curr 的完整課程地圖
Time Complexity
O(V+E) # 訪問所有的點與邊一次
Space Complexity
O(V+E) # 用於 graph 儲存的所有點與邊
2022-04-19 一刷
個人範例程式碼 - 一刷 (2022/04/19)
class Solution:
def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:
if not prerequisites: # no course
return True
return self.bfs(numCourses, prerequisites)
def bfs(self, num_courses, prerequisites):
# init
pre_courses, next_courses = self.get_table(num_courses, prerequisites)
start_courses = []
learned_course = []
for course, pre in pre_courses.items():
if not pre:
start_courses.append(course)
queue = collections.deque(start_courses)
visited = set()
while queue:
course = queue.popleft()
learned_course.append(course)
visited.add(course)
for next_course in next_courses[course]:
pre_courses[next_course].remove(course)
if not pre_courses[next_course] and next_course not in visited: # no pre-courses
queue.append(next_course)
else:
return num_courses == len(learned_course)
def get_table(self, num_courses, prerequisites):
pre_courses = {x:[] for x in range(num_courses)} # for record studied
next_courses = {x:[] for x in range(num_courses)} # for search
for course in prerequisites:
pre_courses[course[1]].append(course[0])
next_courses[course[0]].append(course[1])
return pre_courses, next_courses
算法說明
這題考的是 BFS 中的拓樸排序法,個人認為比較難的是在 graph 操作的部分,其他的概念相對來說還好。
另外處理 start_courses ,去尋找 indegree 為 0 的 node
最近在練習程式碼本身就可以自解釋的 Coding style,可以嘗試直接閱讀程式碼理解
input handling
如果沒有 prerequisites,則必 True (無課程或無先修課)
Boundary conditions
當 queue 為空時,如果還沒有辦法上完全部的課程,則為 False
(可能 Graph 有 loop)