2023年5月18日
[LeetCode] 1557. Minimum Number of Vertices to Reach All Nodes
摘要： Given a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges[i] = [fromi, toi] represents a directed edge fr 阅读全文
posted @ 2023-05-18 14:05 CNoodle 阅读(82) 评论(0) 推荐(0)