Given a collection of intervals, merge all overlapping intervals.
For example,
Given [1,3],[2,6],[8,10],[15,18]
,
return [1,6],[8,10],[15,18]
.
/**
* Definition for an interval.
* public class Interval {
* int start;
* int end;
* Interval() { start = 0; end = 0; }
* Interval(int s, int e) { start = s; end = e; }
* }
*/
public class Solution {
public List<Interval> merge(List<Interval> intervals) {
List<Interval> result=new ArrayList<Interval>();
int m=intervals.size();
if(m<2) return intervals;
Collections.sort(intervals,new Comparator<Interval>(){
@Override
public int compare(Interval e1,Interval e2){
return e1.start-e2.start;
}
});
Interval cur=intervals.get(0);
for(int i=1;i<m;i++){
if(cur.end>=intervals.get(i).start){
cur.end=Math.max(cur.end,intervals.get(i).end);
}else{
result.add(cur);
cur=intervals.get(i);
}
}
result.add(cur);
return result;
}
}