8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 08dda97 commit 11907ccCopy full SHA for 11907cc
May-LeetCoding-Challenge/29-Course-Schedule/Course-Schedule.cpp
@@ -0,0 +1,28 @@
1
+class Solution {
2
+public:
3
+
4
+ bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
5
+ vector<int> deg(numCourses, 0);
6
+ vector<vector<int>> G(numCourses, vector<int>());
7
+ for (int i = 0; i < prerequisites.size(); i ++){
8
+ deg[prerequisites[i][0]]++;
9
+ G[prerequisites[i][1]].push_back(prerequisites[i][0]);
10
+ }
11
12
+ queue<int> q;
13
+ for (int i = 0; i < numCourses; i++) if (!deg[i]) q.push(i);
14
+ int sum = 0;
15
+ while(!q.empty()){
16
+ int i = q.front();
17
+ q.pop();
18
+ sum ++;
19
+ for (auto j: G[i]){
20
+ deg[j]--;
21
+ if (!deg[j]) q.push(j);
22
23
24
25
+ return sum == numCourses;
26
27
28
+};
0 commit comments