0729. My Calendar I
https://leetcode.com/problems/my-calendar-i
Description
You are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a double booking.
A double booking happens when two events have some non-empty intersection (i.e., some moment is common to both events.).
The event can be represented as a pair of integers start
and end
that represents a booking on the half-open interval [start, end)
, the range of real numbers x
such that start <= x < end
.
Implement the MyCalendar
class:
MyCalendar()
Initializes the calendar object.boolean book(int start, int end)
Returnstrue
if the event can be added to the calendar successfully without causing a double booking. Otherwise, returnfalse
and do not add the event to the calendar.
Example 1:
Constraints:
0 <= start < end <= 109
At most
1000
calls will be made tobook
.
ac1: TreeMap
Can be more concise:
ac2: Doublely LinkedList + Binary Search
Use Doublely LinkedList to store intervals;
Binary search find insertion index of start, check if it's valid. Just like above TreeMap approach. Benefit: O(logN) lookup, O(1) insert. The code is lengthy though.
Last updated