Meeting Rooms II

LeetCode 253

# Definition for an interval.
# class Interval:
#     def __init__(self, s=0, e=0):
#         self.start = s
#         self.end = e

class Solution:
    def minMeetingRooms(self, intervals):
        """
        :type intervals: List[Interval]
        :rtype: int
        
        """
        """
        [[0, 30],[5, 10],[15, 20]]
        2
        """
        room = []
        intervals = sorted(intervals, key= lambda x:x.start)
        for item in intervals:
            if not room or item.start < room[0]:
                heapq.heappush(room, item.end)
            else:
                heapq.heappushpop(room, item.end)
                # heapq.heapreplace(room, item.end)
        return len(room)