class Solution {
public:
vector<vector<int>> edges;
vector<int> visited;
vector<int> stack;
bool valid = true;
void dfs(int i){
visited[i] = 1;
for(int j : edges[i]){
if(!visited[j]){
dfs(j);
if (!valid) {
return;
}
}
else if (visited[j] == 1) {
valid = false;
return;
}
}
visited[i] = 2;
stack.push_back(i);
}
vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
edges.resize(numCourses);
visited.resize(numCourses);
for(const auto &info: prerequisites){
edges[info[1]].push_back(info[0]);
}
for(int i = 0; i < numCourses && valid; ++i){
if(!visited[i]){
dfs(i);
}
}
if (!valid) {
return {};
}
reverse(stack.begin(), stack.end());
return stack;
}
};
class Solution {
private:
vector<vector<int>> edges;
vector<int> indeg;
vector<int> result;
public:
vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
edges.resize(numCourses);
indeg.resize(numCourses);
for (const auto& info: prerequisites) {
edges[info[1]].push_back(info[0]);
++indeg[info[0]];
}
queue<int> q;
for (int i = 0; i < numCourses; ++i) {
if (indeg[i] == 0) {
q.push(i);
}
}
while (!q.empty()) {
int u = q.front();
q.pop();
result.push_back(u);
for (int v: edges[u]) {
--indeg[v];
if (indeg[v] == 0) {
q.push(v);
}
}
}
if (result.size() != numCourses) {
return {};
}
return result;
}
};