2018年7月16日
[LeetCode] 802. Find Eventual Safe States 找到最终的安全状态
摘要： We start at some node in a directed graph, and every turn, we walk along a directed edge of the graph. If we reach a terminal node (that is, it has no 阅读全文
posted @ 2018-07-16 20:36 Grandyang 阅读(5126) 评论(5) 推荐(0)
Fork me on GitHub