[leetcode]435. Non-overlapping Intervals

 题目链接：https://leetcode.com/problems/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 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.

class Solution {
public:
    // static bool cmp(vector<int> &a, vector<int> &b){
    //     return a[1]<b[1];
    // }
    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        auto cmp = [](vector<int> &a, vector<int> &b){
            if(a[1] == b[1])
                return a[0] < b[0];
            return a[1]<b[1];
        };


        sort(intervals.begin(),intervals.end(),cmp);
        int count=0;
        int lastInterval=intervals[0][1];
        for(int i=1;i<intervals.size();i++){
            if(intervals[i][0]<lastInterval){
                count++;
            }
            else{
                lastInterval=intervals[i][1];
            }
        }

        return count;
    }
};