My Leetcode: Merge Intervals (Java)

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].

public ArrayList merge(ArrayList intervals) {
 if (intervals==null ||intervals.size()<2 data-blogger-escaped-arraylist="" data-blogger-escaped-intervals="" data-blogger-escaped-nterval="" data-blogger-escaped-return=""> result=new ArrayList();
 Comparator intervalComperator=new Comparator(){
  public int compare(Interval i1, Interval i2){
   Integer i1St=i1.start;
   Integer i2St=i2.start;
   return i1St.compareTo(i2St);
   
  }
 };
 
 Collections.sort(intervals, intervalComperator);
 Interval current=intervals.get(0);
 int i=1;
 while (i
Read full article from My Leetcode: Merge Intervals (Java)