2020年2月26日
[Algo] 132. Deep Copy Undirected Graph
摘要： Make a deep copy of an undirected graph, there could be cycles in the original graph. Assumptions The given graph is not null DFS /* * class GraphNode 阅读全文
posted @ 2020-02-26 11:52 xuan_abc 阅读(248) 评论(0) 推荐(0)
[LC] 138. Deep Copy Linked List With Random Pointer
摘要： Each of the nodes in the linked list has another pointer pointing to a random node in the list or null. Make a deep copy of the original list. /** * c 阅读全文
posted @ 2020-02-26 11:40 xuan_abc 阅读(163) 评论(0) 推荐(0)