给出一个无重叠的按照区间起始端点排序的区间列表。
在列表中插入一个新的区间,你要确保列表中的区间仍然有序且不重叠(如果有必要的话,可以合并区间)。
样例
插入区间[2, 5] 到 [[1,2], [5,9]],我们得到 [[1,9]]。
插入区间[3, 4] 到 [[1,2], [5,9]],我们得到 [[1,2], [3,4], [5,9]]。
python:
"""
Definition of Interval.
class Interval(object):
def __init__(self, start, end):
self.start = start
self.end = end
"""
class Solution:
"""
@param: intervals: Sorted interval list.
@param: newInterval: new interval.
@return: A new interval list.
"""
def insert(self, intervals, newInterval):
# write your code here
results = []
insertPos = 0
for interval in intervals:
if interval.end < newInterval.start:
results.append(interval)
insertPos += 1
elif interval.start > newInterval.end:
results.append(interval)
else:
newInterval.start = min(interval.start, newInterval.start)
newInterval.end = max(interval.end, newInterval.end)
results.insert(insertPos, newInterval)
return results
C++:
/**
* Definition of Interval:
* class Interval {
* public:
* int start, end;
* Interval(int start, int end) {
* this->start = start;
* this->end = end;
* }
* }
*/
class Solution {
public:
/*
* @param intervals: Sorted interval list.
* @param newInterval: new interval.
* @return: A new interval list.
*/
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
// write your code here
vector<Interval> result;
int Pos;
for (Pos = 0; Pos < intervals.size() && intervals[Pos].start < newInterval.start; Pos++)
{
result.push_back(intervals[Pos]);
}
if(!result.empty() && result.back().end >= newInterval.start)
{
result.back().end = max(result.back().end, newInterval.end);
}else{
result.push_back(newInterval);
}
for (int i = Pos; i < intervals.size(); i++)
{
if (result.back().end >= intervals[i].start)
{
result.back().end = max(result.back().end, intervals[i].end);
}else{
result.push_back(intervals[i]);
}
}
return result;
}
};