Leetcode 435. Non-overlapping Intervals[medium]

题目：
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.

---

贪心。
同样是根据右端点排序，然后顺序加入，无法加入的就删除。
这样可以保证，在删除同样多的区间的前提下，覆盖区间的右端点最靠左。

bool cmpt(const Interval &a, const Interval &b) {
    if (a.end == b.end) return a.start < b.start;
    return a.end < b.end;
}

class Solution {
public:
    int eraseOverlapIntervals(vector<Interval>& intervals) {
        if (intervals.size() == 0) return 0;
        sort(intervals.begin(), intervals.end(), cmpt);
        int last = intervals[0].end;
        int ans = 0;
        for (int i = 1; i < intervals.size(); i++) {
            if (intervals[i].start >= last) last = intervals[i].end;
            else ans++;
        }
        return ans;
    }
};