leetcode： Merge Intervals

排序之后，依次把每个区间合并。注意Comparator的写法。

Connections.sort(List, Comparator)进行排序。

/**
 * 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 ArrayList<Interval> merge(ArrayList<Interval> intervals) {
		int i,n;
		n=intervals.size();
		
		if(n==0)
			return new ArrayList<Interval>();
		Comparator<Interval> comparator= new Comparator<Interval>()
		{
					public int compare(Interval i1, Interval i2)
					{
						return i1.start-i2.start;
					}
		};
		Collections.sort(intervals,comparator);
		
		ArrayList<Interval> rst=new ArrayList<Interval>(); 		
		Interval tmp=intervals.get(0);
		Interval ci=new Interval(tmp.start,tmp.end);
		
		for(i=0;i<n;i++)
		{
			
			tmp=intervals.get(i);
			if(tmp.start<=ci.end)
			{
				if(tmp.end>ci.end)
					ci.end=tmp.end;
			}
			else
			{
				rst.add(ci);
				ci=new Interval(tmp.start,tmp.end);
			}
		}
		rst.add(ci);
		
		return rst;
    }
}