C++實(shí)現(xiàn)LeetCode(210.課程清單之二)
[LeetCode] 210. Course Schedule II 課程清單之二
There are a total of n courses you have to take, labeled from 0 to n-1.
Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1]
Given the total number of courses and a list of prerequisite pairs, return the ordering of courses you should take to finish all courses.
There may be multiple correct orders, you just need to return one of them. If it is impossible to finish all courses, return an empty array.
Example 1:
Input: 2, [[1,0]]
Output: [0,1]
Explanation: There are a total of 2 courses to take. To take course 1 you should have finished
course 0. So the correct course order is [0,1] .
Example 2:
Input: 4, [[1,0],[2,0],[3,1],[3,2]]
Output: [0,1,2,3] or [0,2,1,3]
Explanation: There are a total of 4 courses to take. To take course 3 you should have finished both
courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0.
So one correct course order is [0,1,2,3]. Another correct ordering is [0,2,1,3] .
Note:
- The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
- You may assume that there are no duplicate edges in the input prerequisites.
Hints:
- This problem is equivalent to finding the topological order in a directed graph. If a cycle exists, no topological ordering exists and therefore it will be impossible to take all courses.
- Topological Sort via DFS - A great video tutorial (21 minutes) on Coursera explaining the basic concepts of Topological Sort.
- Topological sort could also be done via BFS.
這題是之前那道 Course Schedule 的擴(kuò)展,那道題只讓我們判斷是否能完成所有課程,即檢測有向圖中是否有環(huán),而這道題我們得找出要上的課程的順序,即有向圖的拓?fù)渑判?Topological Sort,這樣一來,難度就增加了,但是由于我們有之前那道的基礎(chǔ),而此題正是基于之前解法的基礎(chǔ)上稍加修改,我們從 queue 中每取出一個數(shù)組就將其存在結(jié)果中,最終若有向圖中有環(huán),則結(jié)果中元素的個數(shù)不等于總課程數(shù),那我們將結(jié)果清空即可。代碼如下:
class Solution {
public:
vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
vector<int> res;
vector<vector<int> > graph(numCourses, vector<int>(0));
vector<int> in(numCourses, 0);
for (auto &a : prerequisites) {
graph[a.second].push_back(a.first);
++in[a.first];
}
queue<int> q;
for (int i = 0; i < numCourses; ++i) {
if (in[i] == 0) q.push(i);
}
while (!q.empty()) {
int t = q.front();
res.push_back(t);
q.pop();
for (auto &a : graph[t]) {
--in[a];
if (in[a] == 0) q.push(a);
}
}
if (res.size() != numCourses) res.clear();
return res;
}
};
Github 同步地址:
https://github.com/grandyang/leetcode/issues/210
類似題目:
參考資料:
https://leetcode.com/problems/course-schedule-ii/
到此這篇關(guān)于C++實(shí)現(xiàn)LeetCode(269.另類字典)的文章就介紹到這了,更多相關(guān)C++實(shí)現(xiàn)另類字典內(nèi)容請搜索腳本之家以前的文章或繼續(xù)瀏覽下面的相關(guān)文章希望大家以后多多支持腳本之家!
相關(guān)文章
VS2022永久配置OpenCV開發(fā)環(huán)境的實(shí)現(xiàn)
本文主要介紹了VS2022永久配置OpenCV開發(fā)環(huán)境的實(shí)現(xiàn),文中通過示例代碼介紹的非常詳細(xì),具有一定的參考價值,感興趣的小伙伴們可以參考一下2022-02-02
C++中關(guān)于[]靜態(tài)數(shù)組和new分配的動態(tài)數(shù)組的區(qū)別分析
這篇文章主要介紹了C++中關(guān)于[]靜態(tài)數(shù)組和new分配的動態(tài)數(shù)組的區(qū)別分析,很重要的概念,需要的朋友可以參考下2014-08-08
OpenCV通過透視變換實(shí)現(xiàn)矯正圖像詳解
這篇文章主要為大家詳細(xì)介紹了OpenCV如何通過透視變換實(shí)現(xiàn)將一張折射的圖片給矯正過來,文中的示例代碼講解詳細(xì),感興趣的小伙伴可以了解一下2023-02-02
淺析設(shè)計模式中的代理模式在C++編程中的運(yùn)用
這篇文章主要介紹了設(shè)計模式中的代理模式在C++編程中的運(yùn)用,代理模式最大的好處就是實(shí)現(xiàn)了邏輯和實(shí)現(xiàn)的徹底解耦,需要的朋友可以參考下2016-03-03

