Merge Intervals

代码：

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

struct Interval {
    int start;
    int end;
    Interval() : start(0), end(0) {}
    Interval(int s, int e) : start(s), end(e) {}
};

bool compare(Interval &a, Interval &b)
{
    return a.start < b.start;
}

vector<Interval> merge(vector<Interval>& intervals) 
{
    vector<Interval> result;
    sort(intervals.begin(), intervals.end(), compare);
    for (int i = 0; i < intervals.size()-1; i++)
    {
        if ((i+1!=intervals.size()-1)&&intervals[i].end >= intervals[i + 1].start)
        {
            intervals[i].end = intervals[i + 1].end;
        }
        else
        {
            result.push_back(intervals[i]);
        }
    }
    return result;
}


int main()
{
    Interval I1(1,3);
    Interval I2(2,6);
    Interval I3(8, 10);
    Interval I4(15,18);
    vector<Interval> itervals;
    itervals.push_back(I1);
    itervals.push_back(I2);
    itervals.push_back(I3);
    itervals.push_back(I4);

    vector<Interval> result = merge(itervals);
    for (int i = 0; i < result.size(); i++)
    {
        cout << result[i].start << "    " << result[i].end << endl;
    }
}