LeetCode-435. Non-overlapping Intervals [C++][Java]

LeetCode-435. Non-overlapping Intervalshttps://leetcode.com/problems/non-overlapping-intervals/

题目描述

Given an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

Example 1:

Input: intervals = [[1,2],[2,3],[3,4],[1,3]]
Output: 1
Explanation: [1,3] can be removed and the rest of the intervals are non-overlapping.

Example 2:

Input: intervals = [[1,2],[1,2],[1,2]]
Output: 2
Explanation: You need to remove two [1,2] to make the rest of the intervals non-overlapping.

Example 3:

Input: intervals = [[1,2],[2,3]]
Output: 0
Explanation: You don't need to remove any of the intervals since they're already non-overlapping.

Constraints:

• 1 <= intervals.length <= 105
• intervals[i].length == 2
• -5 * 104 <= starti < endi <= 5 * 104

解题思路

【C++】

class Solution {
public:
    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        if (intervals.empty()) return 0;
        auto cmp = [](const vector<int>& a, const vector<int>& b) {return a[1] < b[1];};
        sort(intervals.begin(), intervals.end(), cmp);
        int result = 1, end = intervals[0][1], len = intervals.size();
        for (int i = 1; i < len; ++i) {
            if (intervals[i][0] >= end) {
                end = intervals[i][1];
                result++;
            }
        }
        return len - result;
    }
};

【Java】

class Solution {
    public int eraseOverlapIntervals(int[][] intervals) {
        if (intervals.length == 0) return 0;
        Arrays.sort(intervals, (a, b) -> a[1] - b[1]);
        int result = 1, end = intervals[0][1], len = intervals.length;
        for (int i = 1; i < len; ++i) {
            if (intervals[i][0] >= end) {
                end = intervals[i][1];
                result++;
            }
        }
        return len-result;
    }
}

或者

class Solution {
    public int eraseOverlapIntervals(int[][] intervals) {
        if (intervals.length == 0) return 0;
        Arrays.sort(intervals, (a, b) -> Integer.compare(a[1], b[1])); //直接相减会溢出
        int result = 0, end = intervals[0][1], len = intervals.length;
        for (int i = 1; i < len; ++i) {
            if (intervals[i][0] < end) {
                result++;
            } else {
                end = intervals[i][1];
            }
        }
        return result;
    }
}

参考文献

【1】Integer中方法compare和compareTo的区别