← 返回 google 的题目列表Meeting Rooms II
类型：online_judge
Given an array of meeting time intervals where intervals are represented as [start, end], write an algorithm to determine the minimum number of conference rooms required to hold these meetings. There should be no overlap among meetings. Implement a function minMeetingRooms(intervals: List[List[int]]) -> int and provide test cases.
Test Cases:
Input: [[0, 30], [5, 10], [15, 20]] Output: 2
Input: [[7, 10], [2, 4]] Output: 1
Input: [[0, 5], [35, 40], [25, 35], [15, 25]] Output: 1
Example
Input
[[0,30],[5,10],[15,20]]