numbstorm的博客

题目描述： Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for eac

题目描述： There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as

题目描述： There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as