LeetCode 57. Insert Interval（插入区间）

原题网址：https://leetcode.com/problems/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].

方法：二分法查找。

/**
 * 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 {
    private int find(List<Interval> intervals, int start) {
        int i = 0, j = intervals.size()-1;
        while (i<=j) {
            int m = (i+j)/2;
            if (intervals.get(m).start < start) i = m + 1;
            else j = m - 1;
        }
        // i是第一个intervals.get(i).start >= start的区间i
        return i;
    }
    public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
        List<Interval> inserted = new ArrayList<>();
        int pos = find(intervals, newInterval.start);
        for(int i=0; i<pos; i++) inserted.add(intervals.get(i));
        if (pos>0 && newInterval.start <= inserted.get(pos-1).end) {
            inserted.get(pos-1).end = Math.max(inserted.get(pos-1).end, newInterval.end);
        } else {
            inserted.add(newInterval);
        }
        while (pos < intervals.size() && intervals.get(pos).start <= inserted.get(inserted.size()-1).end) {
            inserted.get(inserted.size()-1).end = Math.max(inserted.get(inserted.size()-1).end, intervals.get(pos).end);
            pos ++;
        }
        for(int i=pos; i<intervals.size(); i++) inserted.add(intervals.get(i));
        return inserted;
    }
}