LeetCode—insert-interval（插入间隔）—java

题目描述：

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

思路解析：

• 插入时，需要查看是否与给定的intervals有重叠，若重叠需要合并。
• 遍历每一个interval。
• 如果当前的interval的end小于newInterval的start，说明newInterval在后边，没有重叠，所以先把interval插入。
• 如果当前的interval的start大于newInterval的end，说明newInterval在前边，没有重叠，所以直接把newInterval插入res中，并更新newInterval为当前的interval
• 如果有重叠，那就interval更新为合并后的interval。

代码：

/**
 * 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> intervals, Interval newInterval) {
        ArrayList<Interval> res = new ArrayList<Interval>();
        for(Interval each:intervals){
            if(each.end<newInterval.start){
                res.add(each);
            }else if(each.start>newInterval.end){
                res.add(newInterval);
                newInterval = each;
            }else if(each.end>=newInterval.start || each.start <=newInterval.end){
                int newstart = Math.min(each.start,newInterval.start);
                int newend = Math.max(each.end,newInterval.end);
                newInterval = new Interval(newstart,newend);
            }
        }
        res.add(newInterval);
        return res;
    }
}

参考：https://www.cnblogs.com/springfor/p/3872333.html