[LeetCode] 435. Non-overlapping Intervals

mrcode 发布于2019-08-16 13:45 / 2340人阅读

Problem

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:
You may assume the interval"s end point is always bigger than its start point.
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.

Solution

class Solution {
    public int eraseOverlapIntervals(Interval[] intervals) {
        if (intervals == null || intervals.length == 0) return 0;
        //find non-overlapping count, so sort by end
        Arrays.sort(intervals, (a, b)->(a.end-b.end));
        int end = intervals[0].end;
        int count = 1;
        for (int i = 1; i < intervals.length; i++) {
            if (intervals[i].start >= end) {
                end = intervals[i].end;
                count++;
            }
        }
        return intervals.length-count;
    }
}

GPU服务器服务器托管 Intervals ed435e LeetCode LeetCode_String

文章版权归作者所有，未经允许请勿转载,若此文章存在违规行为，您可以联系管理员删除。

转载请注明本文地址：https://www.ucloud.cn/yun/72267.html

[LeetCode] Insert Interval

Problem Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according to their start times....

Jonathan Shieber 2019-08-19 11:08 评论0 收藏0
[LeetCode] Employee Free Time

Problem We are given a list schedule of employees, which represents the working time for each employee. Each employee has a list of non-overlapping Intervals, and these intervals are in sorted order. ...

go4it 2019-08-19 11:07 评论0 收藏0
leetcode--57--Insert Interval

摘要：问题描述分析这道题的关键在于理解问题，抽取原型，理解中间可以部分如何界定，以及非部分如何进行追加。需要注意的是循环到最后一个元素和在最后一个元素的区别。问题描述： Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You m...

kycool 2019-07-31 11:04 评论0 收藏0
[Leetcode] Merge Intervals and Insert Interval 合并间

摘要：我们只要把所有和该有重叠的合并到一起就行了。最后把前半部分的列表，合并后的大和后半部分的列表连起来，就是结果了。 Merge Intervals 最新更新请见 https://yanjia.me/zh/2019/02/... Given a collection of intervals, merge all overlapping intervals.For example, Gi...

antyiwei 2019-08-14 12:33 评论0 收藏0
leetcode57. Insert Interval

摘要：题目要求给定一组顺序排列且相互之间没有重叠的区间，输入一个区间，将它插入到当前的区间数组中，并且将需要合并的区间合并，之后返回插入并且合并后的区间。我们将这三个类型的区间分别标注为类型，类型，类型。题目要求 Given a set of non-overlapping intervals, insert a new interval into the intervals (merge...

Yuanf 2019-08-16 10:37 评论0 收藏0