352. Data Stream as Disjoint Intervals - Leetcode - SegmentFault
Given a data stream input of non-negative integers a1, a2, ..., an, ..., summarize the numbers seen so far as a list of disjoint intervals.
For example, suppose the integers from the data stream are 1, 3, 7, 2, 6, ..., then the summary will be:
[1, 1] [1, 1], [3, 3] [1, 1], [3, 3], [7, 7] [1, 3], [7, 7] [1, 3], [6, 7]Follow up:
What if there are lots of merges and the number of disjoint intervals are small compared to the data stream's size?
解答：
这题用Maptree会通过map.lowerKey, map.higherKey很快定位到当前数所处在哪两个interval之间，从而进行高效的比较与合并。
Read full article from 352. Data Stream as Disjoint Intervals - Leetcode - SegmentFault
No comments:
Post a Comment