Data Stream as Disjoint Intervals

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?

思路：用treemap，key 是start, 然后用treemap首先去找比自己小的interval，看需不需要merge，然后看比自己大的interval, it.end + 1, 如果有，那么代表需要merge；注意remove的时候是用的key remove的；最后把merge好的 it 加入treemap；O(logN) for add, O(N) for get.

treemap, 比起pq的好处就是：floorKey实际上是个binary search，这里省了很多代码；

class SummaryRanges {
    private class Interval {
        public int start;
        public int end;
        public Interval(int start, int end) {
            this.start = start;
            this.end = end;
        }
    }

    private TreeMap<Integer, Interval> treeMap; // key is interval start;
    /** Initialize your data structure here. */
    public SummaryRanges() {
        treeMap = new TreeMap<Integer, Interval>();
    }
    
    public void addNum(int val) {
        Integer key = treeMap.floorKey(val);
        Interval it = null;
        // 先找floorkey，merge进左边的interval
        if(key == null || treeMap.get(key).end < val - 1) {
            it = new Interval(val, val);
        } else {
            it = treeMap.get(key);
            it.end = Math.max(it.end, val);
        }
        
        //看后面的需不需要merge；
        if(treeMap.containsKey(it.end + 1)) {
            Interval next = treeMap.get(it.end + 1);
            treeMap.remove(it.end + 1); // remove的时候，用的是key;
            it.end = Math.max(it.end, next.end);
        }
        treeMap.put(it.start, it);
    }
    
    public int[][] getIntervals() {
        Set<Integer> keys = treeMap.keySet();
        int[][] res = new int[keys.size()][2];
        int index = 0;
        for(Integer key: treeMap.keySet()) {
            res[index][0] = treeMap.get(key).start;
            res[index][1] = treeMap.get(key).end;
            index++;
        }
        return res;
    }
}

/**
 * Your SummaryRanges object will be instantiated and called as such:
 * SummaryRanges obj = new SummaryRanges();
 * obj.addNum(val);
 * int[][] param_2 = obj.getIntervals();
 */