Package g1201_1300.s1288_remove_covered_intervals

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1288 - Remove Covered Intervals\.

    Medium

    Given an array intervals where <code>intervalsi = l<sub>i</sub>, r<sub>i</sub></code> represent the interval <code>[l<sub>i</sub>, r<sub>i</sub>)</code>, remove all intervals that are covered by another interval in the list.

    The interval [a, b) is covered by the interval [c, d) if and only if c &lt;= a and b &lt;= d.

    Return the number of remaining intervals.

    Example 1:

    Input: intervals = \[\[1,4],3,6,2,8]

    Output: 2

    Explanation: Interval 3,6 is covered by 2,8, therefore it is removed.

    Example 2:

    Input: intervals = \[\[1,4],2,3]

    Output: 1

    Constraints:

    • 1 &lt;= intervals.length &lt;= 1000

    • intervals[i].length == 2

    • <code>0 <= l<sub>i</sub>< r<sub>i</sub><= 10<sup>5</sup></code>

    • All the given intervals are unique.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer removeCoveredIntervals(Array<IntArray> intervals)

      • Methods inherited from class java.lang.Object

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