leetcode 352. 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?

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

给定一个非负整数的数据流输入 a1，a2，…，an，…，将到目前为止看到的数字总结为不相交的区间列表。

例如，假设数据流中的整数为 1，3，7，2，6，…，每次的总结为：

[1, 1]
[1, 1], [3, 3]
[1, 1], [3, 3], [7, 7]
[1, 3], [7, 7]
[1, 3], [6, 7]
 

进阶：
如果有很多合并，并且与数据流的大小相比，不相交区间的数量很小，该怎么办?

解题思路：

这道题分成两个部分：

①通过二分查找找元素插入的位置

②合并相交区间 （有一道类似的题）

class SummaryRanges {
public:
    /** Initialize your data structure here. */
    SummaryRanges() {
        
    }
    
    void addNum(int val) {
        
        v.push_back(val) ;
    }
    
    vector<vector<int>> getIntervals() 
    {
        while(!v.empty())
        {
            int val = v.back() ;
            v.pop_back() ;
            int l = 0 , r = inte.size() ;
            if(inte.empty())
            {
                inte.push_back({val , val}) ;
                continue ;
            }
            while(l < r)
            {
                int m = l + (r - l) / 2 ;
                if(val < inte[m][0]) r = m ;
                else if(val > inte[m][1]) l = m + 1 ;
                else break ;
            }
            
            if(l < r) continue ;
            
            if(l == inte.size()) 
            {
                inte.push_back({val , val}) ;
            }
        
            auto it = inte.begin() ;
            val < inte[l][0] ? it += l : it += l + 1 ;
            inte.insert(it , {val , val}) ;    
        }
        
        inte = mergeinte() ;

        return inte ;
    
    }
    
    vector<vector<int>> mergeinte() 
    {
        vector<vector<int>> res ;
        int l = 0 , r = inte.size() ;
        while(l < r)
        {
            vector<int> temp(inte[l]) ;
            l++ ;
            while(l < r && temp[1] >= inte[l][0] - 1)
            {
                temp[0] = min(temp[0] , inte[l][0]) ;
                temp[1] = max(temp[1] , inte[l][1]) ;
                l++ ;
            }
            res.push_back(temp) ;
        }
        
        return res ;
    }
    
private : 
    
    vector<int> v ;
    vector<vector<int>> inte ;
};

/**
 * Your SummaryRanges object will be instantiated and called as such:
 * SummaryRanges* obj = new SummaryRanges();
 * obj->addNum(val);
 * vector<vector<int>> param_2 = obj->getIntervals();
 */