LeetCode - Insert Interval

作者：disappearedgod

文章出处：http://blog.csdn.net/disappearedgod/article/details/23810157

时间：2014-7-16

题目

Insert Interval

  Total Accepted: 10993  Total Submissions: 55074 My Submissions

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 {
    public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
        if(newInterval == null)
            return intervals;
            List<Interval> retlist = new ArrayList<Interval>();
        if(intervals == null){
            retlist.add(newInterval);
            return retlist;
        }
        
        ListIterator<Interval> it = intervals.listIterator();
        int low = newInterval.start;
        int high = newInterval.end;


        while(it.hasNext()){
            Interval now = it.next();
            if(high < now.start){
                it.previous();
                it.add(new Interval(low,high));
                return intervals;
            }
            else if(low > now.end){
                continue;
            }
            else {
                low = Math.min(low,now.start);
                high = Math.max(high,now.end);
                it.remove();
            }
        }
        it.add(new Interval(low,high));
        return intervals;
    }
}

Submit Time	Status	Run Time	Language
2 minutes ago	Accepted	560 ms	java