题解 | #合并区间#

/**
 * 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) {
      std::vector<Interval> res;
      
      if (intervals.empty()) {
        return res;
      }
      
      std::sort(intervals.begin(), intervals.end(), [](Interval a, Interval b) -> bool {return a.start < b.start;});
      
      res.push_back(intervals[0]);
      
      for (int i = 1; i < intervals.size(); ++i) {
        if (intervals[i].start <= res.back().end) {
          res.back().end = std::max(res.back().end, intervals[i].end);
        } else {
          res.push_back(intervals[i]);
        }
      }
      
      return res;
    }
};