Time: 2294 ms (5.01%), Space: 56.2 MB (8.02%) - LeetHub

Author: birdieHyun

0435-non-overlapping-intervals/0435-non-overlapping-intervals.py

@@ -0,0 +1,21 @@
+from typing import List
+
+
+class Solution:
+    def eraseOverlapIntervals(self, intervals: List[List[int]]) -> int:
+
+        intervals.sort()
+        answer = 0
+
+        prev_end = intervals[0][1]
+
+        for i in intervals[1:]:
+            start, end = i[0], i[1]
+
+            if start >= prev_end:
+                prev_end = end
+            else:
+                answer += 1
+                prev_end = min(end, prev_end)
+
+        return answer