LeetCode每日一题(757. Set Intersection Size At Least Two)

You are given a 2D integer array intervals where intervals[i] = [starti, endi] represents all the integers from starti to 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 <= starti < endi <= 108

---

真的好难。看一下别人的解答吧。配合代码，能看明白，但是这题下次要是换个说法再出现在我面前，大概率还是做不出来。

---

impl Solution {
    pub fn intersection_size_two(mut intervals: Vec<Vec<i32>>) -> i32 {
        intervals.sort_by_key(|l| (l[1], -l[0]));
        let mut largest = -1;
        let mut second = -1;
        let mut ans = 0;
        for itv in intervals {
            let start = itv[0];
            let end = itv[1];
            if start <= second {
                continue;
            }
            if start <= largest {
                ans += 1;
            } else {
                ans += 2;
            }
            second = if start <= largest { largest } else { end - 1 };
            largest = end;
        }
        ans
    }
}