题意:选课顺序,即拓扑排序。标准的Kahn(卡恩)算法和DFS算法
#include<iostream>
#include<vector>
#include<unordered_map>
#include<unordered_set>
#include<stack>
using namespace std;
//方法一:拓扑排序knlp方法
class Solution {
public:
bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
int NumCourseInPre = 0, sum = 0;
unordered_map<int, pair<int, vector<int>>> statis;
unordered_set<int> set;
stack<int> stack;
for (int i = 0; i < prerequisites.size(); i++) {
set.insert(prerequisites[i][0]);
set.insert(prerequisites[i][1]);
//入度点统计
if (statis.find(prerequisites[i][0]) != statis.end())
statis[prerequisites[i][0]].first += 1;
else {
pair<int, vector<int>> tempI;
tempI.first = 1;
statis[prerequisites[i][0]] = tempI;
}
//出度点统计
if (statis.find(prerequisites[i][1]) != statis.end())
statis[prerequisites[i][1]].second.push_back(prerequisites[i][0]);
else {
pair<int, vector<int>> tempO;
tempO.first = 0;
tempO.second.push_back(prerequisites[i][0]);
statis[prerequisites[i][1]] = tempO;
}
}
unordered_map<int, pair<int, vector<int>>>::iterator it;
for (it = statis.begin(); it != statis.end(); ++it) {
if (it->second.first == 0) {
stack.push(it->first);
}
}
while (!stack.empty()) {
int temp = stack.top();
stack.pop();
++sum;
for (int i = 0; i < statis[temp].second.size(); ++i) {
statis[statis[temp].second[i]].first -= 1;
if (statis[statis[temp].second[i]].first == 0) {
stack.push(statis[temp].second[i]);
}
}
}
NumCourseInPre = set.size();
return sum == NumCourseInPre;
}
};
//方法二:dfs方法(网友答案)
class Solution {
public:
enum col
{
WHITE,
GRAY,
BLACK
};
bool DFS(int i, vector<int>& color, vector<list<int>>& adj)
{
color[i] = GRAY;
list<int>::iterator it;
for (it = adj[i].begin(); it != adj[i].end(); it++)
{
if (color[*it] == GRAY)
return true;
if (color[*it] == WHITE && DFS(*it, color, adj))
return true;
}
color[i] = BLACK;
return false;
}
bool canFinish(int numCourses, vector<vector<int>>& prerequisites)
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
vector<list<int>>adj(numCourses);
vector<int> color(numCourses, WHITE);
for (int i = 0; i < prerequisites.size(); i++)
adj[prerequisites[i][0]].push_back(prerequisites[i][1]);
for (int i = 0; i < numCourses; i++)
{
if (color[i] == WHITE)
{
if (DFS(i, color, adj))
return false;
}
}
return true;
}
};