[leetcode] 区间合并问题 Merge Interval

Given a collection of intervals, merge all overlapping intervals.

[1,3],[2,6],[8,10],[15,18]

[1,6],[8,10],[15,18]

/**
* 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> merge(vector<Interval> &intervals) {
int i=0;
if(intervals.size() >1)
for(int i=1; i< intervals.size(); i++) //进行排序
{
Interval inte = intervals[i];
int j;
for(j=i-1; j>=0; j--)
{
if(inte.start< intervals[j].start )
intervals[j+1] = intervals[j];
else
break;
}
intervals[j+1] = inte;
}
else
return intervals;

vector<Interval> out;
out.push_back(intervals[0]);

for(int i=1; i< intervals.size(); i++)
{
if( out.back().end >= intervals[i].start )
out.back().end = max( intervals[i].end, out.back().end );
else
out.push_back( intervals[i] );
}

return out;
}
};