← 返回 google 的题目列表Meeting Rooms Problem
类型:online_judge
Given an array of meeting time intervals where each interval has a start and end time, calculate the minimum number of meeting rooms required to accommodate all the given meetings. Meeting times cannot overlap.
Example
Input
[[0, 30], [5, 10], [15, 20]]