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.

解法：贪心　

这道题是贪心经典问题——区间调度问题的小变形。按照区间调度问题的贪心策略，总是选择结束时间最早的工作，来使得可以安排的工作数目达到最大，同时也使得没有被安排的工作（去掉的区间）数目达到最小。因此，用同样的贪心策略可求解此问题。

/**
 * 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 comp(Interval I1, Interval I2) {
        return I1.end <= I2.end;
    }
    int eraseOverlapIntervals(vector<Interval>& intervals) {
        sort(intervals.begin(), intervals.end(), comp);
        int bound = INT_MIN;
        int res = 0;
        for (int i = 0; i < intervals.size(); i++) {
            if (intervals[i].start >= bound) {
                bound = intervals[i].end;
            } else {
                res++;
            }
        }
        return res;
    }
};

>,<