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

找到不和newInterval直接放到res中，否则维持newInterval的start和end的值，作为重合区域的newInterval。

Runtime: 14 ms  runtime beats 91.12% of java submissions.

	public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
		if (intervals == null || newInterval == null) {
			return intervals;
		}
		List<Interval> res = new ArrayList<>();
		for (int i = 0; i < intervals.size(); i++) {
			Interval cur = intervals.get(i);
			if (cur.end < newInterval.start) {
				res.add(cur);
			} else if (cur.start > newInterval.end) {
				res.add(newInterval);
				newInterval = cur;
			} else {
				newInterval.start = Math.min(cur.start, newInterval.start);
				newInterval.end = Math.max(cur.end, newInterval.end);
			}
		}
		res.add(newInterval);
		return res;
	}

看此文章的第二种解法说明