leetcode #57. 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:

Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
Output: [[1,5],[6,9]]
Example 2:

Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
Output: [[1,2],[3,10],[12,16]]
Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].
NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

思路借鉴
因为原来的intervals的数组已经排序， 所以可以分成下面三个步骤
a. 把前面所有和newInterval没有交集的都加到结果中
b. 把和newInterval有交集的都合并到newInterval上
c. 把最后和newInterval没有交集的加到结果中

class Solution {
    public int[][] insert(int[][] intervals, int[] newInterval) {
        
        List <int[]> list =new ArrayList<>();
        int i = 0;
        
        //判断新的intervals中的没一个数组的后一位是否小于新数组的第一位（没有交交集），如果小于则加入list
        while(i<intervals.length && intervals[i][1]<newInterval[0]){
            list.add(intervals[i]);
            i++;
        }
        
        //如果有交集，则merge
        //如果第i个interval前一位小于 newInterval 的后一位则merge并存入newInterval
        while(i<intervals.length&& intervals[i][0]<=newInterval[1]){
            newInterval[0] = Math.min(intervals[i][0],newInterval[0]);
            newInterval[1] = Math.max(intervals[i][1],newInterval[1]);
            i++;
        }
        
        //如果nerge结束 添加new interval（新组成）到list
        list.add(newInterval);
        
        while(i<intervals.length){
            list.add(intervals[i]);
            i++;
        }
        
        return list.toArray(new int[0][]);//确定dimention
        
    }
}

总结
题目本身不难
如果理解此类题型只需要把条件赵清楚
利用一个index i，不同条件一次向后遍历