leetcode.com 1851. Minimum Interval to Include Each Query

문제 링크: https://leetcode.com/problems/minimum-interval-to-include-each-query/description/

Author: skysign

leetcode.com 1851. Minimum Interval to Include Each Query/main.py

@@ -0,0 +1,24 @@
+from typing import List
+import heapq
+
+class Solution:
+    def minInterval(self, intervals: List[List[int]], queries: List[int]) -> List[int]:
+        length = len(intervals)
+        intervals.sort()
+        heap = []
+        dict = {}
+        idx = 0
+
+        for q in sorted(queries):
+            while idx < length and intervals[idx][0] <= q:
+                left, right = intervals[idx]
+                l = right - left + 1
+                heapq.heappush(heap, [l, right])
+                idx += 1
+
+            while heap and heap[0][1] < q:
+                heapq.heappop(heap)
+
+            dict[q] = heap[0][0] if heap else -1
+
+        return [dict[q] for q in queries]

leetcode.com 1851. Minimum Interval to Include Each Query/test_main.py

@@ -0,0 +1,13 @@
+from unittest import TestCase
+from main import Solution
+
+class TestSolution(TestCase):
+    def test1_min_interval(self):
+        sol = Solution()
+        self.assertEqual([3,3,1,4], \
+                         sol.minInterval([[1,4],[2,4],[3,6],[4,4]], [2,3,4,5]))
+
+    def test2_min_interval(self):
+        sol = Solution()
+        self.assertEqual([2,-1,4,6], \
+                         sol.minInterval([[2,3],[2,5],[1,8],[20,25]], [2,19,5,22]))