mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
32 lines
1.2 KiB
HTML
32 lines
1.2 KiB
HTML
<p>An integer interval <code>[a, b]</code> (for integers <code>a < b</code>) is a set of all consecutive integers from <code>a</code> to <code>b</code>, including <code>a</code> and <code>b</code>.</p>
|
|
|
|
<p>Find the minimum size of a set S such that for every integer interval A in <code>intervals</code>, the intersection of S with A has a size of at least two.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> intervals = [[1,3],[1,4],[2,5],[3,5]]
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> 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.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> intervals = [[1,2],[2,3],[2,4],[4,5]]
|
|
<strong>Output:</strong> 5
|
|
<strong>Explanation:</strong> An example of a minimum sized set is {1, 2, 3, 4, 5}.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= intervals.length <= 3000</code></li>
|
|
<li><code>intervals[i].length == 2</code></li>
|
|
<li><code>0 <= a<sub>i</sub> < b<sub>i</sub> <= 10<sup>8</sup></code></li>
|
|
</ul>
|