leetcode 57: Insert Interval

最新推荐文章于 2021-07-14 20:50:59 发布

mikefan1991

最新推荐文章于 2021-07-14 20:50:59 发布

阅读量238

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/mikefan1991/article/details/48462393

版权

leetcode 专栏收录该内容

201 篇文章 0 订阅

订阅专栏

Loop the array once and merge the newInterval with every intervals. If it cannot be merged into any interval, just insert.

/**
 * 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:
    vector<Interval> insert(vector<Interval>& intervals, Interval newInterval) {
        int size=intervals.size();
        vector<Interval> res;
        bool flag=0;//mark whether the newInterval has been inserted
        for(int i=0;i<size;i++)
        {
            if(intervals[i].end<newInterval.start)
                res.push_back(intervals[i]);
            else if(intervals[i].start>newInterval.end)
            {
                if(!flag)
                {
                    res.push_back(newInterval);
                    flag=1;
                }
                res.push_back(intervals[i]);
            }
            else
            {
                newInterval.start=min(newInterval.start,intervals[i].start);
                newInterval.end=max(newInterval.end,intervals[i].end);
            }
        }
        if(!flag)
            res.push_back(newInterval);
        return res;
    }
};