文章目录
-
- 一、题目
- 二、题解
一、题目
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[i].length == 2
-5 * 104
二、题解
class Solution {
public:
static bool cmp(vectorint>& a,vectorint>& b){
return a[0] b[0];
}
int eraseOverlapIntervals(vectorvectorint>>& intervals) {
sort(intervals.begin(),intervals.end(),cmp);
int res = 0;
for(int i = 1;i intervals.size();i++){
if(intervals[i][0] intervals[i-1][1]){
res++;
intervals[i][1] = min(inte服务器托管网rvals[i-1][1],intervals[i][1]);
}
}
return res;
}
};
服务器托管，北京服务器托管，服务器租用 http://www.fwqtg.net
相关推荐: openGauss学习笔记-141 openGauss 数据库运维-例行维护-例行重建索引
文章目录 openGauss学习笔记-141 openGauss 数据库运维-例行维护-例行重建索引 141.1 背景信息 141.2 重建索引 141.3 操作步骤 openGauss学习笔记-141 openGauss 数服务器托管网据库运维-例行维护-例…
