LeetCode - 56 - Merge Intervals

Given a collection of intervals, merge all overlapping intervals.

For example,
Given [1,3],[2,6],[8,10],[15,18],
return [1,6],[8,10],[15,18].

Subscribe to see which companies asked this question.

题意：给出一些区间，求合并后的区间

思路：按start排序，排序完后直接合并

唔，感觉跟刚才那两题是一个套路

/**
 * 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:
    static bool cmp(const Interval a, const Interval b) {
        if (a.start == b.start) return a.end < b.end;
        return a.start < b.start;
    }
    
    vector<Interval> merge(vector<Interval>& a) {
        int len = a.size();
        vector<Interval> ans;
        ans.clear();
        if (len == 0) return ans;
        sort(a.begin(), a.end(), cmp);
        int st = 0;
        for (int i = 1; i < len; i++) {
            if (a[i].start > a[st].end) {
                ans.push_back(a[st]);
                st = i;
            }
            else {
                a[st].end = max(a[st].end, a[i].end);
            }
        }
        ans.push_back(a[st]);
        return ans;
    }
};