2016 年 2月 8 日随笔档案 - neverlandly

2016年2月8日

摘要： You have two every large binary trees: T1, with millions of nodes, and T2, with hundreds of nodes. Create an algorithm to decide if T2 is a subtree of 阅读全文

posted @ 2016-02-08 23:45 neverlandly 阅读(414) 评论(0) 推荐(0) 编辑

Leetcode: Reconstruct Itinerary

摘要： refer to Recursion https://leetcode.com/discuss/84702/share-my-solution and Iteration https://leetcode.com/discuss/84706/share-solution-java-greedy-st 阅读全文

posted @ 2016-02-08 12:29 neverlandly 阅读(4075) 评论(0) 推荐(0) 编辑