leetcode 757. Set Intersection Size At Least Two

最新推荐文章于 2023-02-25 23:03:36 发布

景行cmy

最新推荐文章于 2023-02-25 23:03:36 发布

阅读量134

点赞数

分类专栏： leetcode 贪心

本文链接：https://blog.csdn.net/cmy203/article/details/99864511

版权

leetcode 同时被 2 个专栏收录

155 篇文章 0 订阅

订阅专栏

贪心

4 篇文章 0 订阅

订阅专栏

该博客探讨了如何找到一个最小的集合S，使得对于给定的所有连续整数区间A，S与A的交集至少包含2个元素。并提供了两个示例说明问题，以及指出解题思路引用了grandyang的详细分析。

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

An integer interval [a, b] (for integers a < b) is a set of all consecutive integers from a to b, including a and b.

Find the minimum size of a set S such that for every integer interval A in intervals, the intersection of S with A has size at least 2.

Example 1:

Input: intervals = [[1, 3], [1, 4], [2, 5], [3, 5]]
Output: 3
Explanation:
Consider the set S = {2, 3, 4}.  For each interval, there are at least 2 elements from S in the interval.
Also, there isn't a smaller size set that fulfills the above condition.
Thus, we output the size of this set, which is 3.

Example 2:

Input: intervals = [[1, 2], [2, 3], [2, 4], [4, 5]]
Output: 5
Explanation:
An example of a minimum sized set is {1, 2, 3, 4, 5}.

Note:

intervals will have length in range [1, 3000].
intervals[i] will have length 2, representing some integer interval.
intervals[i][j] will be an integer in [0, 10^8].

解题思路：

最近懒得写分析了，grandyang大神的分析十分详细，思路差不多；

class Solution {
public:
    int intersectionSizeTwo(vector<vector<int>>& intervals) 
    {
        sort(intervals.begin() , intervals.end() , 
             [](vector<int> &a , vector<int> &b){if(a[1] == b[1]) return a[0] > b[0] ;
                                                else return a[1] < b[1] ;} )   ;
        vector<int> res ;
        
        for(auto inter : intervals)
        {
            int cnt = 0 ;
            for(int j = res.size() - 1 ; j >= 0 ; --j)
            {
                if(res[j] >= inter[0] && res[j] <= inter[1]) cnt++ ;
                if(cnt == 2) break ;
            }
            if(cnt == 0) 
            {
                res.push_back(inter[1] - 1) ;
                res.push_back(inter[1]) ;
            }
            else if(cnt == 1)
            {
                res.push_back(inter[1]) ;
            }
        }
        
        return res.size() ;
    }
};