[LeetCode] Find Eventual Safe States 找到最終的安全狀態
阿新 • • 發佈:2018-07-16
diff sts tin rec terminal dia art ecif which so that for any choice of where to walk, we must have stopped at a terminal node in less than is a list of labels
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
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]
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]
[0, graph.length - 1]
.
s
[LeetCode] Find Eventual Safe States 找到最終的安全狀態