LeetCode //C - 1288. Remove Covered Intervals

1288. Remove Covered Intervals

Given an array intervals where i n t e r v a l s i = l i , r i intervalsi = l_i, r_i intervalsi=li,ri represent the interval [ l i , r i ) [l_i, r_i) [li,ri), remove all intervals that are covered by another interval in the list.

The interval [a, b) is covered by the interval [c, d) if and only if c <= a and b <= d.

Return the number of remaining intervals.

Example 1:

Input: intervals = \[1,4,3,6,2,8]

Output: 2

Explanation: Interval 3,6 is covered by 2,8, therefore it is removed.

Example 2:

Input: intervals = \[1,4,2,3]

Output: 1

Constraints:
  • 1 <= intervals.length <= 1000
  • intervalsi.length == 2
  • 0 < = l i < r i < = 10 5 0 <= li < ri <= 10^5 0<=li<ri<=105
  • All the given intervals are unique.

From: LeetCode

Link: 1288. Remove Covered Intervals


Solution:

Ideas:

Sort by start ascending and end descending, then count intervals whose right endpoint is greater than every previous right endpoint.

Code:
c 复制代码
#include <stdlib.h>

static int compare(const void* a, const void* b) {
    int* intervalA = *(int**)a;
    int* intervalB = *(int**)b;

    // Sort left endpoint ascending.
    if (intervalA[0] != intervalB[0]) {
        return intervalA[0] - intervalB[0];
    }

    // For equal left endpoints, sort right endpoint descending.
    return intervalB[1] - intervalA[1];
}

int removeCoveredIntervals(int** intervals, int intervalsSize,
                           int* intervalsColSize) {
    (void)intervalsColSize;

    qsort(intervals, intervalsSize, sizeof(int*), compare);

    int remaining = 0;
    int maxRight = -1;

    for (int i = 0; i < intervalsSize; i++) {
        if (intervals[i][1] > maxRight) {
            remaining++;
            maxRight = intervals[i][1];
        }
    }

    return remaining;
}
相关推荐
是main不是漫5 小时前
【快慢指针 | LeetCode202 快乐数】鸽巢原理佐证环特性,快慢指针巧解快乐数
c语言·开发语言·c++·算法
Felven6 小时前
A. Iskander and Drawings
算法
Rabitebla8 小时前
【Linux】文件篇(五):手撕简易 FILE——模拟实现 C 标准 I/O 缓冲机制
linux·服务器·c语言·笔记·学习·ubuntu
qq_3482318510 小时前
大模型算法: 反向传播
算法
电科_银尘10 小时前
【大模型算法与工程 27】训练配方:批量、学习率、精度与梯度裁剪
学习·算法·机器学习
专注仿真11 小时前
智能体训练之模仿学习:GAIL 算法详解与实战
python·算法·仿真·多智能体强化学习·afsim智能体训练
leobertlan13 小时前
痛苦系列 | DSP-04 截断时空的“窗”:FIR 滤波器设计与线性相位
算法
秋天的怀念_David14 小时前
算法一千零一夜 · 第三十五夜 · 恢复风暴
java·程序人生·算法
泯泷15 小时前
别再“裸聊”大模型了!你家的 AI 为什么总胡说八道?根子在 RAG
人工智能·算法·架构