[LeetCode] Insert Interval

[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;
}
};


说明:版权所有,转载请注明出处。 Coder007的博客
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值