[LeetCode]435. Non-overlapping Intervals

Description:

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.

———————————————————————————————————————————————————

Solution:

思路：尽可能多的举办活动，而活动的数量取决于每个活动时间的结束时间，而不在于开始时间、持续时间。

贪心算法：初始化一个空的集合S，将输入数组按结束时间增序排序，遍历数组，若当前interval的开始时间大于等于上一个interval的结束时间，则加入到集合S中，直到遍历结束，（这样得到的集合S就是互不重叠的interval），最后用初始数组大小减去集合S的大小即可。

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s), end(e) {}
 * };
 */
bool cmp (Interval a, Interval b) {
    return a.end < b.end || (a.end == b.end && a.start < b.start);
}
class Solution {
public:
    int eraseOverlapIntervals(vector<Interval>& intervals) {
        
        if (intervals.size() <= 1)
            return 0;
        sort(intervals.begin(), intervals.end(), cmp);
        
        int count = 1;
        for (int i = 1, index = 0; i < intervals.size(); i++) {
            if (intervals[i].start >= intervals[index].end) {
                index = i;
                count++;
            }
        }
        
        
        return intervals.size() - count;
    }
};