Comment on page


729. My Calendar I



Implement a MyCalendar class to store your events. A new event can be added if adding the event will not cause a double booking.
Your class will have the method, book(int start, int end). Formally, this represents a booking on the half open interval [start, end), the range of real numbers x such that start <= x < end.
A double booking happens when two events have some non-empty intersection (ie., there is some time that is common to both events.)
For each call to the method, return true if the event can be added to the calendar successfully without causing a double booking. Otherwise, return false and do not add the event to the calendar.
Your class will be called like this: MyCalendar cal = new MyCalendar();, end)
Example 1:
MyCalendar();, 20); // returns true, 25); // returns false, 30); // returns true
The first event can be booked. The second can't because time 15 is already booked by another event.
The third event can be booked, as the first event takes every time less than 20, but not including 20.
The number of calls to per test case will be at most 1000.
In calls to, end), start and end are integers in the range [0, 10^9].


Approach #1 Brute Force

class MyCalendar {
List<int[]> calendar;
public MyCalendar() {
calendar = new ArrayList();
public boolean book(int start, int end) {
for (int[] iv: calendar) {
if (iv[0] < end && start < iv[1]) {
return false;
calendar.add(new int[]{start, end});
return true;
* Your MyCalendar object will be instantiated and called as such:
* MyCalendar obj = new MyCalendar();
* boolean param_1 =,end);

Approach #2 Balanced Tree

class MyCalendar {
TreeMap<Integer, Integer> calendar;
MyCalendar() {
calendar = new TreeMap();
public boolean book(int start, int end) {
Integer prev = calendar.floorKey(start);
Integer next = calendar.ceilingKey(start);
// calendar.get(prev)) <= start <= end <= next
if ((prev == null || calendar.get(prev) <= start)
&& (next == null || end <= next)) {
calendar.put(start, end);
return true;
return false;