[LeetCode] Insert Interval

最新推荐文章于 2020-11-04 20:53:35 发布

1.02^365的成长裂变

最新推荐文章于 2020-11-04 20:53:35 发布

阅读量3.5k

点赞数

分类专栏： LeetCode1

本文链接：https://blog.csdn.net/raojunyang/article/details/77924913

版权

LeetCode1 专栏收录该内容

120 篇文章 0 订阅

订阅专栏

[Problem]

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

You may assume that the intervals were initially sorted according to their start times.

Example 1:
Given intervals [1,3],[6,9], insert and merge [2,5] in as [1,5],[6,9].

Example 2:
Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9] in as [1,2],[3,10],[12,16].

This is because the new interval [4,9] overlaps with [3,5],[6,7],[8,10].

[Solution]

// 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 Solution {
public:
    // check the two intervals wether they are interlocked
    bool check(Interval inter1, Interval inter2){
        if((inter1.start >= inter2.start && inter1.start <= inter2.end) || (inter1.end >= inter2.start && inter1.end <= inter2.end)){
            return true;
        }
        else if((inter2.start >= inter1.start && inter2.start <= inter1.end) || (inter2.end >= inter1.start && inter2.end <= inter1.end)){
            return true;
        }
        else{
            return false;
        }
    }
   
    // merge the two intervals
    Interval merge(Interval inter1, Interval inter2){
        Interval inter;
        inter.start = inter1.start < inter2.start ? inter1.start : inter2.start;
        inter.end = inter1.end > inter2.end ? inter1.end : inter2.end;
        return inter;
    }
   
    // insert
    vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<Interval> res;
   
        bool inserted = false;
        for(int i = 0; i < intervals.size(); ++i){
            Interval inte;
            if(!inserted){
                // can be merged with newInterval
                if(check(intervals[i], newInterval)){
                    inte = merge(intervals[i], newInterval);
                    inserted = true;
                }
                // the newInterval should be inserted first
                else if(newInterval.end < intervals[i].start){
                    res.push_back(newInterval);
                    inserted = true;
                    inte = intervals[i];
                }
                else{
                    inte = intervals[i];
                }
            }
            else{
                inte = intervals[i];
            }
            if(res.size() > 0 && check(res.back(), inte)){
                inte = merge(res.back(), inte);
                res.pop_back();
            }
            res.push_back(inte);
        }
        // the newInterval has never been inserted
        if(!inserted){
            res.push_back(newInterval);
        }
        return res;
    }
};