题目描述:
In a directed graph, we start at some node and every turn, walk along a directed edge of the graph. If we reach a node that is terminal (that is, it has no outgoing directed edges), we stop.
Now, say our starting node is eventually safe if and only if we must eventually walk to a terminal node. More specifically, there exists a natural number K
so that for any choice of where to walk, we must have stopped at a terminal node in less than K
steps.
Which nodes are eventually safe? Return them as an array in sorted order.
The directed graph has N
nodes with labels 0, 1, ..., N-1
, where N
is the length of graph
. The graph is given in the following form: graph[i]
is a list of labels j
such that (i, j)
is a directed edge of the graph.
Example: Input: graph = [[1,2],[2,3],[5],[0],[5],[],[]] Output: [2,4,5,6] Here is a diagram of the above graph.
Note:
graph
will have length at most10000
.- The number of edges in the graph will not exceed
32000
. - Each
graph[i]
will be a sorted list of different integers, chosen within the range[0, graph.length - 1]
.
class Solution {
public:
vector<int> eventualSafeNodes(vector<vector<int>>& graph) {
int n=graph.size();
vector<int> visited(n,-1); //-1表示没有访问过,0表示正在访问,1表示已经访问过
vector<int> result;
for(int i=0;i<n;i++)
{
if(DFS(graph,i,visited))
result.push_back(i);
}
return result;
}
bool DFS(vector<vector<int>>& graph, int i, vector<int>& visited) // 返回i出发是否会进入环中
{ // 如果visited[i]==1,说明在当前DFS中,i和起点连通,而且i被重复访问了,所以i在环中
if(visited[i]!=-1) return visited[i]==1;
visited[i]=0; // 当前DFS正在访问i
for(int neighbor:graph[i])
{
if(visited[neighbor]==1) continue;
if(visited[neighbor]==0||!DFS(graph,neighbor,visited))
return false;
}
visited[i]=1; // 结束对i的访问,表示从i开始遍历的话不会进入环中
return true;
}
private:
unordered_map<int,bool> map;
};