算法系列——无重叠区间(Non-overlapping Intervals)

BridgeGeorge

已于 2022-03-19 01:48:28 修改

阅读量1.1k

点赞数

分类专栏：算法系列文章标签：算法

于 2017-08-18 14:43:52 首次发布

本文链接：https://blog.csdn.net/ylyg050518/article/details/75217367

版权

本文介绍了一个算法问题——如何找到最小数量的无重叠区间。首先，需要对区间按起始点升序排序，然后遍历区间，若当前区间与上一区间有重叠，则移除end值较大的区间并增加移除计数。通过这种方式，可以确保移除最少的区间以实现无重叠。详细解题思路和示例解析帮助理解算法实现。

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

题目描述

题目链接:https://leetcode-cn.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.

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.

解题思路

这道题给了我们一堆区间，让我们求需要至少移除多少个区间才能使剩下的区间没有重叠，那么我们首先要给区间排序，根据每个区间的start来做升序排序，然后我们开始要查找重叠区间，判断方法是看如果前一个区间的end大于后一个区间的start，那么一定是重复区间，此时我们结果res自增1，我们需要删除一个，那么此时我们究竟该删哪一个呢，为了保证我们总体去掉的区间数最小，我们去掉那个end值较大的区间，而在代码中ÿ