Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    435 - Non-overlapping Intervals.

    Medium

    Given an array of intervals intervals where <code>intervalsi = start<sub>i</sub>, end<sub>i</sub></code>, return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

    Example 1:

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

    Output: 1

    Explanation: 1,3 can be removed and the rest of the intervals are non-overlapping.

    Example 2:

    Input: intervals = [1,2,1,2,1,2]

    Output: 2

    Explanation: You need to remove two 1,2 to make the rest of the intervals non-overlapping.

    Example 3:

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

    Output: 0

    Explanation: You don't need to remove any of the intervals since they're already non-overlapping.

    Constraints:

    • <code>1 <= intervals.length <= 10<sup>5</sup></code>

    • intervals[i].length == 2

    • <code>-5 * 10<sup>4</sup><= start<sub>i</sub>< end<sub>i</sub><= 5 * 10<sup>4</sup></code>

    • 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 eraseOverlapIntervals(Array<IntArray> intervals)
      • Methods inherited from class java.lang.Object

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