30. 插入区间

30. 插入区间

给出一个无重叠的按照区间起始端点排序的区间列表。

在列表中插入一个新的区间，你要确保列表中的区间仍然有序且不重叠（如果有必要的话，可以合并区间）。

样例

样例 1：

输入:

(2, 5) into [(1,2), (5,9)]

输出:

[(1,9)]

样例 2：

输入:

(3, 4) into [(1,2), (5,9)]

输出:

[(1,2), (3,4), (5,9)]

 

/**

* Definition of Interval:

* public classs Interval {

*     int start, end;

*     Interval(int start, int end) {

*         this.start = start;

*         this.end = end;

*     }

* }

*/





public class Solution {

    /**

     * @param intervals: Sorted interval list.

     * @param newInterval: new interval.

     * @return: A new interval list.

     */

    public List<Interval> insert(List<Interval> intervals, Interval newInterval) {

        List<Interval> result=new ArrayList<>();

            int i = 0;

            for (; i < intervals.size(); i++) {

                Interval interval=intervals.get(i);

                if (interval.start<newInterval.start&&interval.end<newInterval.start){

                    result.add(interval);

                }else if(interval.start>newInterval.end&&interval.end>newInterval.end){

                    break;

                }else {

                    newInterval.start=Math.min(newInterval.start,interval.start);

                    newInterval.end=Math.max(newInterval.end,interval.end);

                }

            }

            result.add(newInterval);

            for (; i < intervals.size(); i++) {

                Interval interval=intervals.get(i);

                result.add(interval);

            }

            return result;

    }

}