[LeetCode] 57. Insert Interval Java

標籤：may   val   example   set   win   span   max   init   over   

題目：

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; } * } */class Solution {    //給出一個按升序排序的非重疊區間序列，插入一個新區間，合并有重疊的區間    public List<Interval> insert(List<Interval> intervals, Interval newInterval) {       List<Interval> res = new ArrayList<>();        int i=0;        while(i<intervals.size() && intervals.get(i).end<newInterval.start){ //交叉區間之前的直接加入            res.add(intervals.get(i++));        }        while(i<intervals.size() && intervals.get(i).start <= newInterval.end){     //有交叉區間            newInterval = new Interval(                    Math.min(intervals.get(i).start,newInterval.start),                    Math.max(intervals.get(i).end,newInterval.end)            );            i++;        }        res.add(newInterval);        while (i < intervals.size())        //重疊區間之後的也直接加入            res.add(intervals.get(i++));        return res;    }}

 

[LeetCode] 57. Insert Interval Java