Leetcode#435. Non-overlapping Intervals
Problem
Given an array of intervals intervals
where intervals[i] = [starti, endi]
, return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.
Example 1:
1 | Input: intervals = [[1,2],[2,3],[3,4],[1,3]] |
Example 2:
1 | Input: intervals = [[1,2],[1,2],[1,2]] |
Example 3:
1 | Input: intervals = [[1,2],[2,3]] |
Constraints:
1 <= intervals.length <= 10^5
intervals[i].length == 2
5 * 10^4 <= starti < endi <= 5 * 10^4
Solve
1 | class Solution: |
本部落格所有文章除特別聲明外,均採用 CC BY-NC-SA 4.0 許可協議。轉載請註明來自 Imisky!
評論