207 https://leetcode-cn.com/problems/course-schedule/
210 https://leetcode-cn.com/problems/course-schedule-ii/
class Solution {
private:
vector<vector<int>> edges;//建立一个邻接表
vector<int> visited;//0未搜索,1搜索中,2搜索完
vector<int> result;
bool valid = true;
public:
bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
edges.resize(numCourses);
visited.resize(numCourses);
for(auto c : prerequisites)
{
edges[c[1]].push_back(c[0]);//建立邻接表
}
for(int i = 0; i < numCourses && valid; i++)
{
if(!visited[i])//没有搜索的
{
dfs(i);
}
if(!valid)//判断环
{
return false;
}
}
return true;
}
void dfs(int u)
{
visited[u] = 1;//搜索中
for(auto c : edges[u])
{
if(visited[c] == 0)//临边没有搜索过就去搜索临边
{
dfs(c);
if(!valid)
{
return;
}
}else if(visited[c] == 1)
{
valid = false;
return;//判断是不是有环
}
}
visited[u] = 2;
result.push_back(u);
}
};
class Solution {
private:
vector<vector<int>> edges;//存储有向图
vector<int>visited;// 标记每个节点的状态:0=未搜索,1=搜索中,2=已完成
vector<int>result; // 用数组来模拟栈,下标 0 为栈底,n-1 为栈顶
bool valid = true;
public:
void dfs(int u)
{
visited[u] = 1;
for(auto v : edges[u])
{
if(visited[v] == 0)
{
dfs(v);
if(!valid)
{
return;
}
}
else if(visited[v] == 1)
{
valid = false;
return;
}
}
visited[u] = 2;
result.push_back(u);
}
vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
edges.resize(numCourses);
visited.resize(numCourses);
for(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(result.begin(),result.end());
return result;
}
};