57. 插入区间
难度中等379
给你一个 无重叠的 *,*按照区间起始端点排序的区间列表。
在列表中插入一个新的区间,你需要确保列表中的区间仍然有序且不重叠(如果有必要的话,可以合并区间)。
示例 1:
输入:intervals = [[1,3],[6,9]], newInterval = [2,5] 输出:[[1,5],[6,9]]
示例 2:
输入:intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8] 输出:[[1,2],[3,10],[12,16]] 解释:这是因为新的区间 [4,8] 与 [3,5],[6,7],[8,10] 重叠。
示例 3:
输入:intervals = [], newInterval = [5,7] 输出:[[5,7]]
示例 4:
输入:intervals = [[1,5]], newInterval = [2,3] 输出:[[1,5]]
示例 5:
输入:intervals = [[1,5]], newInterval = [2,7] 输出:[[1,7]]
提示:
0 <= intervals.length <= 104
intervals[i].length == 2
0 <= intervals[i][0] <= intervals[i][1] <= 105
intervals
根据intervals[i][0]
按 升序 排列newInterval.length == 2
0 <= newInterval[0] <= newInterval[1] <= 105
class Solution {
public:
vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
intervals.push_back(newInterval);
vector<vector<int>> ans;
sort(intervals.begin(), intervals.end());
int i;
for(i = 0; i < intervals.size()-1; ++i)
{
if(intervals[i][1] >= intervals[i+1][0] && intervals[i][1] >= intervals[i+1][1])
{
intervals[i+1][0] = intervals[i][0];
intervals[i+1][1] = intervals[i][1];
}
else if(intervals[i][1] >= intervals[i+1][0])
intervals[i+1][0] = intervals[i][0];
else
ans.push_back(intervals[i]);
}
ans.push_back(intervals[i]);
return ans;
}
};
class Solution {
public:
vector<vector<int>> insert(vector<vector<int>>& I, vector<int>& n) {
int Isize = I.size();
if(I.empty() || n[0]>I[Isize-1][1]) {I.push_back(n); return I;}
if(n[1]<I[0][0]){ I.insert(I.begin(),n);return I;}
int pos =0;
int beginPos=0;
while(pos<Isize && I[pos][0] <= n[0])pos++;
if(pos>0 && I[pos-1][0] <= n[0] && I[pos-1][1]>=n[0]) beginPos=--pos; //n[0]在I[pos-1]区间内
else{//n[0]不在I[pos-1]区间内,修改I[pos]左边界
I.insert(I.begin()+pos,n);
beginPos = pos++;
}
int endPos = beginPos;
Isize = I.size();
while(pos< Isize && I[pos][0] <= n[1])pos++;