public class Solution {
public ArrayList<Interval> insert(ArrayList<Interval> intervals, Interval newInterval) {
if(intervals==null||newInterval==null) {
return intervals;
}
if(intervals.size()==0) {
intervals.add(newInterval);
return intervals;
}
ListIterator<Interval> it = intervals.listIterator();
while(it.hasNext()) {
Interval tmpInterval = it.next();
if(newInterval.end<tmpInterval.start) {
it.previous();
it.add(newInterval);
return intervals;
} else {
if(tmpInterval.end<newInterval.start) {
continue;
} else {
newInterval.start = Math.min(tmpInterval.start, newInterval.start);
newInterval.end = Math.max(tmpInterval.end, newInterval.end);
it.remove();
}
}
}
intervals.add(newInterval);
return intervals;
}
}LeetCode Insert Interval,布布扣,bubuko.com
原文:http://blog.csdn.net/worldwindjp/article/details/21612731