LeetCode 802. Find Eventual Safe States

802. Find Eventual Safe States

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 most 10000.
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].

Approach

题目大意：在有向图中，判断每个点是否一定只能到达terminal点（只有入度的点），包括自己
解决方法：类似染色的方式，将点分为三种：未染色，已染色标记为不安全点，已染色标记为安全点。
实现思路：采用DFS，每次判断该点是否已染色，若染色则判断是否是安全的，若未染色，先标记其不安全，然后穷举该点可达的点，若都是安全的点，那么可判定这个点也是安全的，将其标记为安全。

Code

C++

class Solution {
public:
    vector<int> eventualSafeNodes(vector<vector<int>>& graph) {
        int N = graph.size();
        vector<int>terminal;
        vector<int>color(N, 0);
        for (int i = 0; i < N; i++) {
            if (dfs(i, graph, color)) {
                terminal.push_back(i);
            }
        }
        return terminal;
    }
    bool dfs(int v, vector<vector<int>>& graph, vector<int> &color) {
        if (color[v] != 0)return color[v] == 1;
        color[v] = 2;
        for (auto &u : graph[v]) {
            if (!dfs(u, graph, color)) {
                return false;
            }
        }
        color[v] = 1;
        return true;
    }
};