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:
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:

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], [3,4], [1,3] ]
Output: 1
Explanation: [1,3] can be removed and the rest of intervals are non-overlapping.

解法

按照end的大小升序排列，如果end相等就按start升序排列。从头开始，将当前元素的start和last_end比较，start < end说明有重合, 否则说明没有重合，更新last_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:
    static bool Cmp_interval(Interval a, Interval b) {
        if (a.end == b.end)
            return a.start < b.start;
        else
            return a.end < b.end;
    }
    int eraseOverlapIntervals(vector<Interval>& intervals) {
        if (intervals.empty()) return 0;
        sort(intervals.begin(),intervals.end(),Cmp_interval);
        int count = 0;
        int last_end = INT_MIN;
        for(auto val : intervals) {
            if (val.start < last_end) {
                count++;
            } else {
                last_end = val.end;
            }
        }
        return count;       
    }
};