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

[解题思路]

新建一个ArrayList来保存得到的结果。因为对原来的集合进行操作时如下情况需要额外的操作：newInterval插入当前interval之前

1.newInterval.end < curInterval.start, 插入

2.newInterval.end > curInterval.start, continue

3.newInterval 与 curInterval 重合,合并得到新的newInterval 

/**
 * 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 static ArrayList<Interval> insert(ArrayList<Interval> intervals,
            Interval newInterval) {
        ArrayList<Interval> result = new ArrayList<Interval>();
        for (int i = 0; i < intervals.size(); i++) {
            Interval tmp = intervals.get(i);
            if (newInterval.end < tmp.start) {
                result.add(newInterval);
                for(int j = i; j < intervals.size(); j++){
                    result.add(intervals.get(j));
                }
                return result;
            } else if (newInterval.start > tmp.end) {
                result.add(tmp);
                continue;
            } else {
                newInterval.start = Math.min(tmp.start, newInterval.start);
                newInterval.end = Math.max(tmp.end, newInterval.end);
            }
        }
        result.add(newInterval);
        return result;
    }
}