2021年5月27日
[LeetCode] 1129. Shortest Path with Alternating Colors 颜色交替的最短路径
摘要： Consider a directed graph, with nodes labelled 0, 1, ..., n-1. In this graph, each edge is either red or blue, and there could be self-edges or parall 阅读全文
posted @ 2021-05-27 11:56 Grandyang 阅读(851) 评论(0) 推荐(0) 编辑
Fork me on GitHub