[LeetCode]Merge Interval

懒得自己写了。。代码这里来的：点击

总体来讲就是先按照x来sort，x一样sort y, 然后比较前面的y和后面的x

public ArrayList merge(ArrayList intervals) {  
    ArrayList res = new ArrayList();  
    if(intervals==null || intervals.size()==0)  
        return intervals;  
    Comparator comp = new Comparator()  
    {  
        @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);  

    res.add(intervals.get(0));  
    for(int i=1;iif(res.get(res.size()-1).end>=intervals.get(i).start)  
        {  
            res.get(res.size()-1).end = Math.max(res.get(res.size()-1).end, intervals.get(i).end);  
        }  
        else  
        {  
            res.add(intervals.get(i));  
        }  
    }  
    return res;  
}  

转载于:https://www.cnblogs.com/jxlgetter/p/4395082.html