feat: Solve meeting-rooms-ii problem

Author: hu6r1s

meeting-rooms-ii/hu6r1s.py

@@ -0,0 +1,30 @@
+from typing import (
+    List,
+)
+from lintcode import (
+    Interval,
+)
+
+"""
+Definition of Interval:
+class Interval(object):
+    def __init__(self, start, end):
+        self.start = start
+        self.end = end
+"""
+from heapq import heappush, heappop
+
+class Solution:
+    """
+    @param intervals: an array of meeting time intervals
+    @return: the minimum number of conference rooms required
+    """
+    def min_meeting_rooms(self, intervals: List[Interval]) -> int:
+        # Write your code here
+        intervals.sort()
+        ends = []
+        for start, end in intervals:
+            if ends and ends[0] <= start:
+                heappop(ends)
+            heappush(ends, end)
+        return len(ends)