LeetCode Insert Interval

题目：

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

You may assume that the intervals were initially sorted according to their start times.

Example 1:
Given intervals [1,3],[6,9], insert and merge [2,5] in as [1,5],[6,9].

Example 2:
Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9] in as [1,2],[3,10],[12,16].

This is because the new interval [4,9] overlaps with [3,5],[6,7],[8,10].

题解：

此题和之前的那题很像，只是换汤不换药，增加了一个新引入的数组，那么可以先将这个新引入的数组添加到原来的那个数组中，然后再利用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 List<Interval> insert(List<Interval> intervals,Interval newInterval)
	{
		intervals.add(newInterval);
		List<Interval> list = new ArrayList<Interval>();
		if(intervals.size() == 0)
			return list;
		Collections.sort(intervals,new Com());
		list.add(intervals.get(0));
		for(int i = 1; i < intervals.size(); i++)    //作比较，此题的思路可以和largestNumbers做对比
		{
			if(intervals.get(i).start <= list.get(list.size() - 1).end)
			{
				if(intervals.get(i).end > list.get(list.size() - 1).end)
				{
					list.get(list.size() - 1).end = intervals.get(i).end;
				}
			}
			else if(intervals.get(i).start > list.get(list.size() - 1).end)
			{
				list.add(intervals.get(i));
			}
		}
		return list;
	}
}
class Com implements Comparator<Interval>
{
	public int compare(Interval o1, Interval o2) 
	{
		return o1.start - o2.start;
	}
}