题目描述
给出一个无重叠的按照区间起始端点排序的区间列表。
在列表中插入一个新的区间,你要确保列表中的区间仍然有序且不重叠(如果有必要的话,可以合并区间)。
样例1
输入:
(2, 5) into [(1,2), (5,9)]
输出:
[(1,9)]
样例2
输入:
(3, 4) into [(1,2), (5,9)]
输出:
[(1,2), (3,4), (5,9)]
解题思路
定位到区间集与待插入的区间开始重合的部分,然后开始求交集。
交集一直延伸到相交区间的最末端。
java题解
public class Solution {
public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
if (newInterval == null || intervals == null) {
return intervals;
}
List<Interval> results = new ArrayList<Interval>();
int insertPos = 0;
for (Interval interval : intervals) {
if (interval.end < newInterval.start) {
results.add(interval);
insertPos++;
} else if (interval.start > newInterval.end) {
results.add(interval);
} else {
newInterval.start = Math.min(interval.start, newInterval.start);
newInterval.end = Math.max(interval.end, newInterval.end);
}
}
results.add(insertPos, newInterval);
return results;
}
}
C++题解
class Solution {
public:
vector<Interval> insert(vector<Interval>& intervals, Interval newInterval) {
// write your code here
vector<Interval> ans;
int st;
for (st = 0; st < intervals.size() && intervals[st].start < newInterval.start; st++) {
ans.push_back(intervals[st]);
}
if (!ans.empty() && ans.back().end >= newInterval.start) {
ans.back().end = max(ans.back().end, newInterval.end);
} else {
ans.push_back(newInterval);
}
for (int i = st; i < intervals.size(); i++) {
if (ans.back().end >= intervals[i].start) {
ans.back().end = max(ans.back().end, intervals[i].end);
} else {
ans.push_back(intervals[i]);
}
}
return ans;
}
};
python题解
from lintcode import Interval
class Solution:
def insert(self, intervals, newInterval):
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