2018年3月15日

Lintcode247 Segment Tree Query II solution 题解
摘要： 【题目描述】 For an array, we can build a Segment Tree for it, each node stores an extra attribute count to denote the number of elements in the the array w 阅读全文
posted @ 2018-03-15 16:59 bokeyyy 阅读(131) 评论(1) 推荐(0)
Lintcode245 Subtree solution 题解
摘要： 【题目描述】 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 subt 阅读全文
posted @ 2018-03-15 16:57 bokeyyy 阅读(138) 评论(1) 推荐(0)

导航