We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1b53a94 commit 0a17927Copy full SHA for 0a17927
src/non_overlapping_intervals.py
@@ -1,15 +1,23 @@
1
class Solution:
2
def eraseOverlapIntervals(self, intervals: list[list[int]]) -> int:
3
+ if not intervals:
4
+ return 0
5
+
6
n = len(intervals)
7
result = 0
- intervals = sorted(intervals, key=lambda x: x[0])
- last_end = intervals[0][1]
8
+ intervals.sort()
9
10
+ _, end = intervals[0]
11
12
for i in range(1, n):
- if intervals[i][0] < last_end:
- last_end = min(last_end, intervals[i][1])
13
+ next_start, next_end = intervals[i]
14
15
+ if next_start < end:
16
result += 1
17
18
+ if next_end < end:
19
+ end = next_end
20
else:
- last_end = intervals[i][1]
21
22
23
return result
0 commit comments