题解 | #合并区间#

public ArrayList<interval> merge(ArrayList<interval> intervals) {
Collections.sort(intervals, (o1, o2) -> {
int i = o1.start - o2.start;
if (i == 0) {
return o1.end - o2.end;
}
return i;
});
int index = -1;
ArrayList<interval> list = new ArrayList<>();
for (Interval interval : intervals) {
if(index==-1 || interval.start > list.get(list.size() - 1).end){
list.add(interval);
index++;
}else {
int curIndex = list.size() - 1;
Interval interval1 = list.get(curIndex);
list.remove(interval1);
interval1.end = Math.max(interval1.end,interval.end);
list.add(interval1);
}
}
return list;
}</interval></interval></interval>