Leetcode——57. Insert Interval

题目原址

https://leetcode.com/problems/insert-interval/description/

题目描述

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].

解题思路

这个题和56题MergeIntervals的解法是一样的，只不过这个题多加了一个节点，但是可以通过list的add（）方法将该节点添加到集合中，之后这个题就与MergeIntervals一样了。

AC代码

/**
 * 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> ret = new ArrayList<Interval>();
        intervals.add(newInterval);
        Collections.sort(intervals, new Comparator<Interval> (){

            @Override
            public int compare(Interval o1, Interval o2) {
                // TODO Auto-generated method stub
                return o1.start - o2.start;
            }           
        }); 

        if(intervals.size() == 0)
            return ret;

        Interval i1 = intervals.get(0); //前面的元素
        for(int i = 0; i < intervals.size(); i++) {
                Interval i2;
                //如果当前元素是最后一个元素，则将i2的值设置为new Interval(Integer.MAX_VALUE + 1,Integer.MAX_VALUE);其中注意是Integer.MAX_VALUE + 1，因为有可能最后一个元素的end中的值是Integer.MAX_VALUE
                if(i == intervals.size() - 1)
                    i2 = new Interval(Integer.MAX_VALUE + 1,Integer.MAX_VALUE);
                else
                    i2 = intervals.get(i + 1); //如果不是最后一个元素，则获取i紧后面的元素

                //合并中间元素的值
                if(i2.start >= i1.start && i2.start <= i1.end) {
                    i1.end = Math.max(i1.end, i2.end); 
                }else{
                    ret.add(i1);
                    i1 = i2;
                }
        }

        return ret;     
    }
}