LeetCode-merge-intervals

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; }
 * }
 */
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
public class Solution {
    public ArrayList<Interval> merge(ArrayList<Interval> intervals) {
        if (intervals.size()<2)return intervals;
         Comparator<Interval> comp = new Comparator<Interval>()
        {
            @Override
            public int compare(Interval i1, Interval i2)
            {
                if(i1.start==i2.start)
                    return i1.end-i2.end;
                return i1.start-i2.start;
            }
        };
        Collections.sort(intervals,comp);
        ArrayList<Interval> res=new ArrayList<Interval>();
        Interval compre=intervals.get(0);
        res.add(compre);
        for(int i=1;i<intervals.size();i++){
            if (res.get(res.size()-1).end>=intervals.get(i).start){
                res.get(res.size()-1).end=Math.max(intervals.get(i).end,res.get(res.size()-1).end);
            }else {
                res.add(intervals.get(i));
 
            }
        }
 
 
        return  res;
    }
}