public class {
public List<Interval> merge(List<Interval> intervals) {
List<Interval> res = new ArrayList<Interval>();
if(intervals.size() == 0) {
return res;
}
Collections.sort(intervals, new Comparator<Interval>(){
public int compare(Interval i1, Interval i2) {
if(i1.start - i2.start != 0) {
return i1.start - i2.start;
} else {
return i1.end - i2.end;
}
}
});
Interval pre = intervals.get(0);
for(int i = 1; i < intervals.size(); i++){
Interval cur = intervals.get(i);
if(pre.end < cur.start) {
res.add(pre);
pre = cur;
} else {
pre.end = Math.max(pre.end, cur.end);
}
}
res.add(pre);
return res;
}
}
近期评论