LeetCode //C - 757. Set Intersection Size At Least Two

757. Set Intersection Size At Least Two

You are given a 2D integer array intervals where i n t e r v a l s [ i ] = [ s t a r t i , e n d i ] intervals[i] = [start_i, end_i] intervals[i]=[starti,endi] represents all the integers from s t a r t i start_i starti to e n d i end_i endi inclusively.

A containing set is an array nums where each interval from intervals has at least two integers in nums.

  • For example, if intervals = [[1,3], [3,7], [8,9]], then [1,2,4,7,8,9] and [2,3,4,8,9] are containing sets.

Return the minimum possible size of a containing set.

Example 1:

Input: intervals = [[1,3],[3,7],[8,9]]
Output: 5
Explanation: let nums = [2, 3, 4, 8, 9].

It can be shown that there cannot be any containing array of size 4.

Example 2:

Input: intervals = [[1,3],[1,4],[2,5],[3,5]]
Output: 3
Explanation: let nums = [2, 3, 4].

It can be shown that there cannot be any containing array of size 2.

Example 3:

Input: intervals = [[1,2],[2,3],[2,4],[4,5]]
Output: 5
Explanation: let nums = [1, 2, 3, 4, 5].

It can be shown that there cannot be any containing array of size 4.

Constraints:
  • 1 <= intervals.length <= 3000
  • intervals[i].length == 2
  • 0 < = s t a r t i < e n d i < = 10 8 0 <= start_i < end_i <= 10^8 0<=starti<endi<=108

From: LeetCode

Link: 757. Set Intersection Size At Least Two


Solution:

Ideas:
  • Sort intervals by end point (ascending), then by start point (descending) when end points are equal

  • Track state using two variables: point1 and point2 (last two points added to our set)

  • Process each interval and check how many of our current points it contains:

    • Contains 0 points (start > point2): Add 2 points at positions end-1 and end
    • Contains 1 point (start > point1): Add 1 point at position end
    • Contains 2+ points: Add 0 points
Code:
c 复制代码
// Comparator function to sort intervals by end point
// If end points are equal, sort by start point in descending order
int compare(const void* a, const void* b) {
    int* intervalA = *(int**)a;
    int* intervalB = *(int**)b;
    if (intervalA[1] != intervalB[1]) {
        return intervalA[1] - intervalB[1];  // Sort by end point ascending
    }
    return intervalB[0] - intervalA[0];  // If end points equal, sort by start point descending
}

int intersectionSizeTwo(int** intervals, int intervalsSize, int* intervalsColSize) {
    if (intervalsSize == 0) return 0;
    
    // Sort intervals by end point
    qsort(intervals, intervalsSize, sizeof(int*), compare);
    
    int count = 0;
    int point1 = INT_MIN;  // Second to last point added
    int point2 = INT_MIN;  // Last point added
    
    for (int i = 0; i < intervalsSize; i++) {
        int start = intervals[i][0];
        int end = intervals[i][1];
        
        if (start > point2) {
            // Current interval doesn't contain any of our points
            // Add the two rightmost points of this interval
            count += 2;
            point1 = end - 1;
            point2 = end;
        } else if (start > point1) {
            // Current interval contains only point2
            // Add one more point (the rightmost one)
            count += 1;
            point1 = point2;
            point2 = end;
        }
        // If start <= point1, then the interval contains both point1 and point2
        // No need to add any points
    }
    
    return count;
}
相关推荐
前端炒粉1 小时前
18.矩阵置零(原地算法)
javascript·线性代数·算法·矩阵
暴风鱼划水2 小时前
三维重建【0-D】3D Gaussian Splatting:相机标定原理与步骤
算法·3d
mount_myj4 小时前
敏感信息屏蔽(一)【java】
java·算法·极课堂
先做个垃圾出来………5 小时前
偏移量解释
数据结构·算法
Dream it possible!5 小时前
LeetCode 面试经典 150_链表_旋转链表(64_61_C++_中等)
c++·leetcode·链表·面试
FanXing_zl5 小时前
基于整数MCU的FOC控制定标策略深度解析
单片机·嵌入式硬件·mcu·算法·定点运算·q15
立志成为大牛的小牛5 小时前
数据结构——三十三、Dijkstra算法(王道408)
数据结构·笔记·学习·考研·算法·图论
憨憨崽&6 小时前
C语言、Java、Python 的选择与未来发展以及学习路线
java·c语言·python
地平线开发者6 小时前
mul 与 reduce_sum 的优化实例
算法·自动驾驶