[leetcode] 802. Find Eventual Safe States

Description 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 sto

>>阅读原文<<