Leetcode

253. Meeting Rooms II

by hooni posted Apr 15, 2020
?

단축키

Prev이전 문서

Next다음 문서

ESC닫기

크게 작게 위로 아래로 댓글로 가기 인쇄

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.

Example 1:

Input: [[0, 30],[5, 10],[15, 20]]
Output: 2

Example 2:

Input: [[7,10],[2,4]]
Output: 1

Note:
input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.


class Solution {
}

[문제] https://leetcode.com/problems/meeting-rooms-ii/