← 返回 roblox 的题目列表Meeting Rooms II (LeetCode 253)
类型：qbank
Given meeting time intervals, compute the minimum number of rooms needed so no meetings assigned to the same room overlap.
Examples
Example 1:
Input: intervals = [(0,40),(5,10),(15,20)]
Output: 2
Explanation:
room1: (0,40) room2: (5,10),(15,20)
Example 2:
Input: intervals = [(4,9)]
Output: 1
Constraints
0 <= intervals.length <= 500
0 <= intervals[i].start < intervals[i].end <= 1,000,000