迭代器——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].

考虑以下情况： 
如果新区间的end < 当前区间的start，不用找下去了，把新区间插入到当前区间的前面，然后返回。
如果当前区间的end小于新区间的start，继续遍历找下一个区间。
如果当前区间和新区间发生重合，则start取两者最小的start，end取两者最大的end，生成一个新的区间。
继续遍历。

/**
 * 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.*;
public class Solution {
    public ArrayList<Interval> insert(ArrayList<Interval> list, Interval inter) {
        if(inter == null)
            return list;
        if(list.size() == 0)
            {
            list.add(inter);
            return list;
        }        
        ListIterator<Interval> it =list.listIterator();
        while(it.hasNext())
            {
            Interval cur=it.next();
            if(inter.end<cur.start)
                {
                it.previous();
                break;
            }
            else if(inter.start>cur.end)
                {
                continue;
            }
            else//有交集,合并新的inter
                {
                inter.start=Math.min(cur.start,inter.start);
                inter.end=Math.max(cur.end,inter.end);
                it.remove();
            }
        }
           it.add(inter);
        return list;
    }
}