leetcode435. Non-overlapping Intervals

最新推荐文章于 2022-01-25 00:51:48 发布

大大kc

最新推荐文章于 2022-01-25 00:51:48 发布

阅读量422

点赞数 1

分类专栏： leetcode 文章标签： leetcode Greedy

本文链接：https://blog.csdn.net/rxt2012kc/article/details/68946107

版权

给定一组区间，找出需要删除的最少区间数，使得剩下的区间不重叠。按照区间end升序排列，如果下一个区间的start小于前一个的end，则删除下一个。解法包括两种策略。

摘要由CSDN通过智能技术生成

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

Explanat