这题是hard,思考了一下觉得有很多种情况要考虑,,,放弃,后来看了人家的代码发现原来这么随意。还是火候不到哟。思路要到位,这种题见过很多了!
public ArrayList<Interval> insert(ArrayList<Interval> intervals, Interval newInterval) {
ArrayList<Interval> res = new ArrayList<>();
for (Interval each : intervals) {
//集合中直接放入的段,结尾比人家开头还小,当然自觉进入了
if (each.end < newInterval.start) {
res.add(each);
//发现开头比人家结尾还大,于是newInterval自觉进入。同时集合的该分段出列受教训
} else if (each.start > newInterval.end) {
res.add(newInterval);
newInterval = each;
} else if (each.end >= newInterval.start || each.start <= newInterval.end) {
int nstart = Math.min(each.start, newInterval.start);
int nend = Math.max(newInterval.end, each.end);
newInterval = new Interval(nstart, nend);
}
}
res.add(newInterval);
return res;
}