2016 年 11月 25 日随笔档案 - neverlandly

2016年11月25日

摘要： 1-9 : count:9 * len:1 10-99： count:90 * len:2 100-999: count:900 * len:3 1000-9999: count: 9000 * len:4 maintain a count, len, start 阅读全文

posted @ 2016-11-25 06:51 neverlandly 阅读(296) 评论(0) 推荐(0) 编辑

Leetcode: Russian Doll Envelopes

摘要： DP 解法， Time Complexity: O(N^2) sort based on width or height, anyone is ok. After the sorting, for each envelope, those envelopes which can fit into t 阅读全文

posted @ 2016-11-25 05:36 neverlandly 阅读(584) 评论(0) 推荐(0) 编辑

Leetcode: Data Stream as Disjoint Intervals && Summary of TreeMap

摘要： TreeMap 解法： Use TreeMap to easily find the lower and higher keys, the key is the start of the interval.Merge the lower and higher intervals when neces 阅读全文

posted @ 2016-11-25 02:06 neverlandly 阅读(413) 评论(0) 推荐(0) 编辑