Class Solution
-
- All Implemented Interfaces:
public final class Solution2580 - Count Ways to Group Overlapping Ranges\.
Medium
You are given a 2D integer array
rangeswhere <code>rangesi = start<sub>i</sub>, end<sub>i</sub></code> denotes that all integers between <code>start<sub>i</sub></code> and <code>end<sub>i</sub></code> (both inclusive ) are contained in the <code>i<sup>th</sup></code> range.You are to split
rangesinto two (possibly empty) groups such that:Each range belongs to exactly one group.
Any two overlapping ranges must belong to the same group.
Two ranges are said to be overlapping if there exists at least one integer that is present in both ranges.
For example,
[1, 3]and[2, 5]are overlapping because2and3occur in both ranges.
Return the total number of ways to split
rangesinto two groups. Since the answer may be very large, return it modulo <code>10<sup>9</sup> + 7</code>.Example 1:
Input: ranges = \[\[6,10],5,15]
Output: 2
Explanation:
The two ranges are overlapping, so they must be in the same group.
Thus, there are two possible ways:
Put both the ranges together in group 1.
Put both the ranges together in group 2.
Example 2:
Input: ranges = \[\[1,3],10,20,2,5,4,8]
Output: 4
Explanation:
Ranges 1,3, and 2,5 are overlapping. So, they must be in the same group.
Again, ranges 2,5 and 4,8 are also overlapping. So, they must also be in the same group.
Thus, there are four possible ways to group them:
All the ranges in group 1.
All the ranges in group 2.
Ranges 1,3, 2,5, and 4,8 in group 1 and 10,20 in group 2.
Ranges 1,3, 2,5, and 4,8 in group 2 and 10,20 in group 1.
Constraints:
<code>1 <= ranges.length <= 10<sup>5</sup></code>
ranges[i].length == 2<code>0 <= start<sub>i</sub><= end<sub>i</sub><= 10<sup>9</sup></code>
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description public classSolution.Companion
-
Field Summary
Fields Modifier and Type Field Description public final static Solution.CompanionCompanion
-
Constructor Summary
Constructors Constructor Description Solution()
-