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

Java 版本 参考自 点击打开链接

public class Solution {
    public int eraseOverlapIntervals(Interval[] intervals) {
        if(intervals==null || intervals.length==0){
            return 0;
        }
        Arrays.sort(intervals, new Comparator<Interval>() {
 
            public int compare(Interval o1, Interval o2) {
                return o1.end - o2.end;
            }
        });
        
        int sumcount = intervals.length;
        int count =0;
        int last=intervals[0].start;
        for(int i=0;i<sumcount;i++){
            if( intervals[i].end>intervals[i].start && intervals[i].start>=last){
                count++;
                last = intervals[i].end;
            }
        }
        return sumcount-count;
    }
}

C++版本 参考自 点击打开链接

class Solution {

    public:
    int eraseOverlapIntervals(vector<Interval>& intervals) {
        
        if ( intervals.size() == 0) {
            return 0;
        }
        sort(intervals.begin(), intervals.end(), [](Interval& a, Interval& b){return a.end <= b.end;});

        int length = intervals.size();
        int count = 0;
        int last = intervals[0].start;
        for (int i = 0; i < length; i++) {
            if (intervals[i].end > intervals[i].start && intervals[i].start >=last) {
                count ++;
                last = intervals[i].end;
            }
        }
        return length - count;
    }

};