QuestionGiven an array of meeting time intervalsintervalswhereintervals[i] = [starti, endi], returnthe minimum number of conference rooms required.Example 1:Input: intervals = [[0,30],[5,10],[15,20]]
Output: 2Example 2:Input: intervals = [[7,10],[2,4]]
Output: 1Constraints:1 <= intervals.length <= 1040 <= starti < endi <= 106AlgorithmA typical Chronological Ordering. We will need total order or both start and ends.While we sort start and order individually. It's fine because : we don't really care about which meeting ends and we only need to know there is a meeting ends and room are available.
...
继续阅读
(68)