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.

题目链接：https://leetcode.com/problems/insert-interval/

题目分析：二分去找左端点小于等于新区间左端点最大的区间位置以及左端点小于等于新区间右端点最大的区间位置，这么做是为了确定整个合并区间的左端点(mergeStart)和右端点(mergeEnd)的位置，然后模拟区间合并即可，注意新区间不在原区间范围之内的情况

1ms，时间击败99.09%

class Solution {
    
    public int findIntervalPos(int[][] intervals, int x) {
        int l = 0, r = intervals.length - 1, mid = 0, ans = -1;
        while (l <= r) {
            mid = (l + r) >> 1;
            if (intervals[mid][0] <= x) {
                ans = mid;
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }
        return ans;
    }
    
    public int[][] insert(int[][] intervals, int[] newInterval) {
        if (intervals.length == 0) {
            return new int[][]{newInterval};
        }

        int leftIntervalPos = findIntervalPos(intervals, newInterval[0]);
        int rightIntervalPos = findIntervalPos(intervals, newInterval[1]);
        
        int mergeStart = 0;
        if (leftIntervalPos != -1 && intervals[leftIntervalPos][1] >= newInterval[0]) {
            mergeStart = intervals[leftIntervalPos][0];
        } else {
            mergeStart = newInterval[0];
        }

        int mergeEnd = 0;
        if (rightIntervalPos != -1 && intervals[rightIntervalPos][0] <= newInterval[1]) {
            mergeEnd = Math.max(newInterval[1], intervals[rightIntervalPos][1]);
        } else {
            mergeEnd = newInterval[1];
        }
        //System.out.println("start = " + mergeStart + " end = " + mergeEnd);
        int pos = 0;
        List<int[]> ans = new ArrayList<int[]>();
        boolean merged = false;
        if (intervals[0][0] > mergeEnd) {
            ans.add(new int[] {mergeStart, mergeEnd});
            merged = true;
        }
        while (pos < intervals.length) {
            if (intervals[pos][0] >= mergeStart && !merged) {
                while (pos < intervals.length && intervals[pos][1] <= mergeEnd) {
                    pos++;
                }
                ans.add(new int[] {mergeStart, mergeEnd});
                merged = true;
            } else {
                ans.add(intervals[pos++]);
            }
        }
        if (intervals[intervals.length - 1][1] < mergeStart) {
            ans.add(new int[] {mergeStart, mergeEnd});
        }
        return ans.toArray(new int[0][]);
    }
}