【LeetCode】InsertInterval

题目： 

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

解题思路：

假设当前遍历时的区间为tmp, 给的新区间为new, 所得的最后结果为rst.

1. 首先已知给定的interval 是排序好的， 所以我们不用再对他进行排序。
2. 插入时无非有三种情况，遍历时当前区间tmp. end < new.start，那直接将现在区间放入rst中；便利当前区间tmp.start > new.end，那西区间已经更新完毕直接加入rst中；若以上两种情况都不是， 且tmp.end > new.start 或tmp.start< new.end 说明有重叠， 我们来更新new

具体代码如下：

/**
 * 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) {
        if(intervals.size() == 0){
            intervals.add(newInterval);
            return intervals;
        }
        List<Interval> rst = new ArrayList<Interval>();
        for(int i = 0; i < intervals.size(); i ++){
            Interval tmp = intervals.get(i);
            //current interval is in front of the newInterval
            if(tmp.end < newInterval.start)
                rst.add(tmp);
            //finished adding the interval, continue to add rest of the intervals
            else if(tmp.start > newInterval.end){
                System.out.println("tmp is ["+ tmp.start +"] , ["+tmp.end+"]");
                rst.add(newInterval);
                newInterval = tmp;
            }
            //the tmp interval overlap with the newInterval, then update to make a new newInterval
            else{
                int start = Math.min(tmp.start, newInterval.start);
                System.out.println("start is "+ start);
                int end = Math.max(tmp.end, newInterval.end);
                newInterval = new Interval(start, end);
            }
        }
        rst.add(newInterval);
        return rst;
    }
}