[LeetCode] 435. Non-overlapping Intervals

[LeetCode] 435. Non-overlapping Intervals

题目描述

Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

Note:
You may assume the interval’s end point is always bigger than its start point.
Intervals like [1,2] and [2,3] have borders “touching” but they don’t overlap each other.
Example 1:
Input: [ [1,2], [2,3], [3,4], [1,3] ]

Output: 1

Explanation: [1,3] can be removed and the rest of intervals are non-overlapping.

Example 2:
Input: [ [1,2], [1,2], [1,2] ]

Output: 2

Explanation: You need to remove two [1,2] to make the rest of intervals non-overlapping.

Example 3:
Input: [ [1,2], [2,3] ]

Output: 0

Explanation: You don’t need to remove any of the intervals since they’re already non-overlapping.

分析

这里首先对所有的区间按照开始的时间大小从小到大进行排序，然后依次选择一个区间，和上一个区间进行比对，如果有重叠，那么选择时间间隔较小的那个区间，并且选择小的结束时间作为新的结束时间，和下一个时间区间的开始时间进行比对。

/**
 * 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(Interval a, Interval b) {
    return a.start < b.start;
  }
  int eraseOverlapIntervals(vector<Interval>& intervals) {
    sort(intervals.begin(), intervals.end(), cmp);
    int count = 0, end = -9999;
    for (auto i : intervals) {
      if (i.start < end) {
        end = end <= i.end ? end : i.end;
      } else {
        count++;
        end = i.end;
      }
    }
    return intervals.size() - count;
  }
};