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:

1. You may assume the interval's end point is always bigger than its start point.
2. 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.

Subscribe to see which companies asked this question.

题意：给出n个区间，求最少去掉多少个区间可以保证剩余的区间不产生覆盖

思路：按区间start值排序，依次往后对比，当发生覆盖时，去掉end值更大的区间。

好神奇，感觉是很简单的思路，但是就是没做出来

/**
 * 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;
    }
    
    int eraseOverlapIntervals(vector<Interval>& a) {
        sort(a.begin(), a.end(), cmp);
        int len = a.size();
        int ans = 0;
        int com = 0;
        for (int i = 1; i < len; i++) {
            if (a[i].start < a[com].end) {
                ans++;
                if (a[com].end > a[i].end) {
                    com = i;
                }
            }
            else {
                com = i;
            }
        }
        return ans;
    }
};