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:

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.

思路：

用贪心算法，贪心策略是将活动按结束时间递增进行排序，优先选择结束时间早的活动，将有重叠的活动剔除。

程序：

/**
 * 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.end < b.end)||(a.start < b.start && a.end == b.end);
    }

    int eraseOverlapIntervals(vector<Interval>& intervals) {
        if(intervals.size() == 0)
            return 0;
        
        sort(intervals.begin(),intervals.end(),cmp);
        int n = intervals.size();
        int cnt = 1;
        int e = intervals[0].end;
        for(int i = 1;i < n;i++)
        {
            if(intervals[i].start >= e)
            {
                cnt++;
                e = intervals[i].end;
            }
        }
        return n - cnt;
    }
    

};