bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
vector<vector<int>> matrix(numCourses,vector<int>(numCourses,0));
vector<int> inDegree(numCourses);
for(int i = 0;i < prerequisites.size();i++){
int pre = prerequisites[i].second;
int ready = prerequisites[i].first;
if(matrix[pre][ready] == 0){
inDegree[ready]++;
matrix[pre][ready] ++;
}
}
int count = 0;
queue<int> queue;
for(int i = 0;i < inDegree.size();i++){
if(inDegree[i] == 0){
queue.push(i);
}
}
while(!queue.empty()){
int course = queue.front();
queue.pop();
count ++;
for(int i = 0;i < numCourses;i++){
if(matrix[course][i] != 0){
if(--inDegree[i] == 0){
queue.push(i);
}
}
}
}
return count == numCourses;
}
Leetcode 207. Course Schedule
最后编辑于 :
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
- 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
推荐阅读更多精彩内容
- There are a total of n courses you have to take, labeled ...
- There are a total of n courses you have to take, labeled ...
- Problem There are a total of n courses you have to take, ...
- 分析 很显然,这是一个有向无环图的判断问题。只要所有课程中出现了环,就不可能修满所有课程。有向无环图的判断可采用d...
- There are a total of n courses you have to take, labeled ...