2017年2月21日
99. Recover Binary Search Tree
摘要： two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Note:A solution using O(n) space i 阅读全文
posted @ 2017-02-21 21:23 Tsunami_lj 阅读(220) 评论(0) 推荐(0) 编辑
133.Clone Graph
摘要： 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 阅读全文
posted @ 2017-02-21 19:32 Tsunami_lj 阅读(152) 评论(0) 推荐(0) 编辑