2020年5月8日
LeetCode323 Number of Connected Components in an Undirected Graph
摘要： Input: n = 5 and edges = [[0, 1], [1, 2], [3, 4]] 0 3 | ... 阅读全文
posted @ 2020-05-08 12:16 EvanMeetTheWorld 阅读(18) 评论(0) 推荐(0)
LeetCode323 Number of Connected Components in an Undirected Graph
摘要： Input: n = 5 and edges = [[0, 1], [1, 2], [3, 4]] 0 3 | ... 阅读全文
posted @ 2020-05-08 12:16 EvanMeetTheWorld 阅读(18) 评论(0) 推荐(0)
LeetCode319 Minimum height trees
摘要： we have an undirected graph, we can choose any node as root. now, ... 阅读全文
posted @ 2020-05-08 11:01 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
LeetCode319 Minimum height trees
摘要： we have an undirected graph, we can choose any node as root. now, ... 阅读全文
posted @ 2020-05-08 11:01 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
LeetCode269 Alien DIctionary
摘要： given you a list of instance, find the pattern and return it. exam... 阅读全文
posted @ 2020-05-08 04:10 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)
LeetCode269 Alien DIctionary
摘要： given you a list of instance, find the pattern and return it. exam... 阅读全文
posted @ 2020-05-08 04:10 EvanMeetTheWorld 阅读(28) 评论(0) 推荐(0)