/**
* Definition for an interval.
* struct Interval {
* int start;
* int end;
* Interval() : start(0), end(0) {}
* Interval(int s, int e) : start(s), end(e) {}
* };
*/
class Solution {
public:
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
vector<Interval> res;
int newstart=newInterval.start;
int newend=newInterval.end;
bool already=0;
Interval temp;
int i;
for(i=0;i<intervals.size();i++)
{
if(intervals[i].start>newend)
{
res.push_back(Interval(newstart,newend));
already=1;
break;
}
else if(intervals[i].end<newstart)
res.push_back(intervals[i]);
else
{
newstart=min(intervals[i].start,newstart);
newend=max(intervals[i].end,newend);
}
}
if(already)
{
for(;i<intervals.size();i++)
res.push_back(intervals[i]);
}
else
{
res.push_back(Interval(newstart,newend));
}
return res;
}
};
* Definition for an interval.
* struct Interval {
* int start;
* int end;
* Interval() : start(0), end(0) {}
* Interval(int s, int e) : start(s), end(e) {}
* };
*/
class Solution {
public:
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
vector<Interval> res;
int newstart=newInterval.start;
int newend=newInterval.end;
bool already=0;
Interval temp;
int i;
for(i=0;i<intervals.size();i++)
{
if(intervals[i].start>newend)
{
res.push_back(Interval(newstart,newend));
already=1;
break;
}
else if(intervals[i].end<newstart)
res.push_back(intervals[i]);
else
{
newstart=min(intervals[i].start,newstart);
newend=max(intervals[i].end,newend);
}
}
if(already)
{
for(;i<intervals.size();i++)
res.push_back(intervals[i]);
}
else
{
res.push_back(Interval(newstart,newend));
}
return res;
}
};