2021年8月5日
[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 @ 2021-08-05 12:27 CNoodle 阅读(112) 评论(0) 推荐(0) 编辑