-
Notifications
You must be signed in to change notification settings - Fork 3
/
RemoveCoveredIntervals1288.kt
46 lines (33 loc) · 1.01 KB
/
RemoveCoveredIntervals1288.kt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
package medium
/**
* Given an array intervals where intervals[i] = [li, ri] represent 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:
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 <= intervals.length <= 1000
intervals[i].length == 2
0 <= li <= ri <= 105
All the given intervals are unique.
*/
fun removeCoveredIntervals(intervals: Array<IntArray>): Int {
var count = 0
intervals.forEachIndexed { index, arr ->
for(i in intervals.indices)
{
if(i == index) continue
if(arr[0]>= intervals[i][0]&&arr[1]<= intervals[i][1])
{
count++
break
}
}
}
return intervals.size-count
}