Scribd
Upload
124 views1 page

Course Schedule - LeetCode

There are n total courses that need to be taken, numbered 0 to n-1. Some courses have prerequisites where one course must be taken before another, represented as pairs like [0,1]. Given the total courses n and prerequisite pairs, the problem is to determine if it is possible to complete all courses. It takes course graphs as input rather than adjacency matrices and there are no duplicate edges.

Uploaded by

jon monroe
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
124 views1 page

Course Schedule - LeetCode

There are n total courses that need to be taken, numbered 0 to n-1. Some courses have prerequisites where one course must be taken before another, represented as pairs like [0,1]. Given the total courses n and prerequisite pairs, the problem is to determine if it is possible to complete all courses. It takes course graphs as input rather than adjacency matrices and there are no duplicate edges.

Uploaded by

jon monroe
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 1

9/27/2019 Course Schedule - LeetCode

new
Explore Problems Mock Contest Articles Discuss Store Premium

Description Solution Submissions Discuss (781) C++

. Course Schedule
Medium 2225 105 Favorite Share 1▾ class Solution
2 public:
3▾ bool canFi
numCourses, ve
There are a total of n courses you have to take, labeled from 0 to n-1 .
prerequisites)
4
Some courses may have prerequisites, for example to take course 0 you have to 5 }
first take course 1, which is expressed as a pair: [0,1] 6 };

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:

1. The input prerequisites is a graph represented by a list of edges, not


adjacency matrices. Read more about how a graph is represented.
2. You may assume that there are no duplicate edges in the input prerequisites.

Accepted 261,023 Submissions 662,896

Contributor

Companies Console

Problems Pick One Prev 207/1205 Next Run Code

https://leetcode.com/problems/course-schedule/ 1/1

You might also like