data-stream-as-disjoint-intervals

https://leetcode.com/problems/data-stream-as-disjoint-intervals/

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s), end(e) {}
 * };
 */
class SummaryRanges {
    vector<Interval> vec;
    int find(int val) {
        int vlen = vec.size();
        if (vlen == ) {
            return -;
        }
        int begin = ;
        int end = vlen - ;
        int mid;
        while (begin <= end) {
            mid = begin + (end - begin) / ;
            // Here <= vs. >
            if (vec[mid].start > val) {
                end = mid - ;
            }
            else {
                begin = mid + ;
            }
        }
        // Here it's important to return end
        return end;
    }

public:
    /** Initialize your data structure here. */
    SummaryRanges() {

    }

    void addNum(int val) {
        int idx = find(val);
        if (idx < ) {
            if (vec.size() >  && vec[].start == val+) {
                vec[].start = val;
            }
            else {
                Interval inter(val, val);
                vec.insert(vec.begin(), inter);
            }
        }
        else {
            if (vec[idx].end == val-) {
                vec[idx].end = val;
            }
            else if (vec[idx].end < val-) {
                Interval inter(val, val);
                vec.insert(vec.begin()+idx+, inter);
                idx++;
            }
            // check latter
            if (vec.size() > idx+ && vec[idx+].start == vec[idx].end + ) {
                vec[idx].end = vec[idx+].end;
                vec.erase(vec.begin()+idx+);
            }
        }
    }

    vector<Interval> getIntervals() {
        return vec;
    }
};

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