【LeetCode】435. Non-overlapping Intervals 无重叠区间（Medium）（JAVA）每日一题

【LeetCode】435. Non-overlapping Intervals 无重叠区间（Medium）（JAVA）

题目地址: 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.

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.

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.

题目大意

给定一个区间的集合，找到需要移除区间的最小数量，使剩余区间互不重叠。

注意:

1. 可以认为区间的终点总是大于它的起点。
2. 区间 [1,2] 和 [2,3] 的边界相互“接触”，但没有相互重叠。

解题方法

1. 这一题采用先排序的方式。排序后，删掉后面和前面重叠的元素，然后计算删除的元素个数
2. 重点在于如何排序，如：[[1,2],[2,3],[3,4],[1,3]], 到底该如何选择删除元素？
3. 要尽可能删除的元素少，就需要把跨度大的元素删除，如何找出跨度大的元素呢？1、开始相同，但是结尾更大的就是跨度长的；2、结尾相同，开始更小的就是跨度长的
4. 第一种方式排序很容易举出反例如：[[1,9],[2,3],[3,4],[4,5]]，这里 [1,9] 在前面只能删除所有后面元素了，肯定不行
5. 采用第二种方式：结尾相同，开始更小的就是跨度长的。根据结尾进行排序，结尾相同再把开始小的排在后面 [[1,9],[2,3],[3,4],[4,5]] --> [[2,3],[3,4],[4,5],[1,9]]

class Solution {
    public int eraseOverlapIntervals(int[][] intervals) {
        Arrays.sort(intervals, (a, b) -> (a[1] - b[1] == 0 ? -a[0] + b[0] : a[1] - b[1]));
        int res = 0;
        int index = 0;
        for (int i = 1; i < intervals.length; i++) {
            if (intervals[i][0] < intervals[index][1]) {
                res++;
            } else {
                index = i;
            }
        }
        return res;
    }
}

执行耗时:4 ms,击败了51.09% 的Java用户
内存消耗:38.4 MB,击败了59.37% 的Java用户

欢迎关注我的公众号，LeetCode 每日一题更新