合并区间

给出若干闭合区间，合并所有重叠的部分。

样例

给出的区间列表 => 合并后的区间列表：

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

挑战

O(n log n) 的时间和 O(1) 的额外空间。

/**
 * Definition of Interval:
 * classs Interval {
 *     int start, end;
 *     Interval(int start, int end) {
 *         this->start = start;
 *         this->end = end;
 *     }
 */
class Solution {
public:
    static bool compare(const Interval &a, const Interval &b)
    {
        return a.start < b.start;
    }
    /**
     * @param intervals: interval list.
     * @return: A new interval list.
     */
    vector<Interval> merge(vector<Interval> &intervals) {
        // write your code here
        vector<Interval> result;
        int n = intervals.size();
        if (n < 1)
        {
            return result;
        }
        sort(intervals.begin(), intervals.end(), compare);
        int left = intervals[0].start;
        int right = intervals[0].end;
        for (int i = 1; i < n; i++)
        {
            if (intervals[i].start <= right)
            {
                right = max(right, intervals[i].end);
            }
            else
            {
                result.push_back(Interval(left, right));
                left = intervals[i].start;
                right = intervals[i].end;
            }
        }

        result.push_back(Interval(left, right));

        return result;
    }
};