435. Non-overlapping Intervals（贪心）

1.题目描述

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.

2.代码

分析：按 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:
    int eraseOverlapIntervals(vector<Interval>& intervals) {

        if(intervals.size() <= 1) return 0;
        sort(intervals.begin(), intervals.end(), compare);

        int res = 0;
        vector<Interval>::iterator t;
         t = intervals.begin();
        for(vector<Interval>::iterator itr  = intervals.begin()+1; itr != intervals.end(); ++itr) {
            Interval v = *itr;
            Interval u = *t;
            if(v.start < u.end) {
                res++;
                intervals.erase(itr);
                --itr; 
                //注意迭代器要先减后加才能回到正确的位置
            } else {
                t++;
            }
        }
        return res;
    }
    static bool compare(const Interval& v1, const Interval& v2) {
        if(v1.end <= v2.end) return true;
        else return false;
    }
};