Package g0701_0800.s0757_set_intersection_size_at_least_two

Class Solution

java.lang.Object

g0701_0800.s0757_set_intersection_size_at_least_two.Solution

public class Solution
extends Object

757 - Set Intersection Size At Least Two.<p>Hard</p> <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><strong>Example 1:</strong></p> <p><strong>Input:</strong> intervals = [[1,3],[1,4],[2,5],[3,5]]</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong></p> <pre><code> 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. </code></pre> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> intervals = [[1,2],[2,3],[2,4],[4,5]]</p> <p><strong>Output:</strong> 5</p> <p><strong>Explanation:</strong> An example of a minimum sized set is {1, 2, 3, 4, 5}.</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_i < b_i <= 10⁸</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	intersectionSizeTwo(int[][] intervals)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

intersectionSizeTwo

public int intersectionSizeTwo(int[][] intervals)