Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), find the minimum number of conference rooms required.
For example,
Given [[0, 30],[5, 10],[15, 20]],
return 2.
LeetCode:会员题。
heapq的使用:LeetCode23:Merge k Sorted Lists
1. 先把intervals按照start从小到大排序。
2. 建立一个最小堆,堆顶是end最小的interval。
3. 遍历interval,把当前interval的start和堆顶的end对比,如果交叉,说明要重新开一个房间,把该interval加入到最小堆中。
4. 如果不交叉,说明之前的房间用完了我可以接着用,所以将堆顶弹出,将该interval弹入最小堆。
最小堆中的元素数量就是需要的房间个数。
# Definition for an interval.
import heapq
# class Interval(object):
# def __init__(self, s=0, e=0):
# self.start = s
# self.end = e
class Solution:
def minMeetingRooms(self, intervals):
intervals.sort(key=lambda x:x.start)
heap = []
for interval in intervals:
if heap and interval.start >= heap[0]:
heapq.heappop(heap)
heapq.heappush(heap, interval.end)
else:
heapq.heappush(heap, interval.end)
return len(heap)