Remove Covered Intervals
Given an array intervals where intervals[i] = [li, ri] represents the interval [li, ri), 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 <= a and b <= d.
Return the number of remaining intervals.
Example 1
1-----4
3-----6
2-----------8Input
intervals = [[1,4],[3,6],[2,8]]Output
2Interval [3,6] is covered by [2,8], therefore it is removed.
Example 2
1-----4 2-3
Input
intervals = [[1,4],[2,3]]Output
1Interval [2,3] is covered by [1,4], so only one interval remains.
Constraints
- 1 <= intervals.length <= 1000
- intervals[i].length == 2
- 0 <= li < ri <= 10^5
- All the given intervals are unique.