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

思路就是找到要merge的n個區間，然後把這幾個區間删掉，再把新的區間插進去。

s初始化為-1，s+1就是插入的位置。s記錄的是要merge的區間的前一個區間，是以插入位置就是s+1。

i就是要merge的區間的後一個區間。

如果merge錯的話，可能會出現output limit exceeded。

56ms。