|
4 | 4 | import java.util.List;
|
5 | 5 | import java.util.TreeMap;
|
6 | 6 |
|
7 |
| -/** |
8 |
| - * 729. My Calendar I |
9 |
| - * |
10 |
| - * Implement a MyCalendar class to store your events. A new event can be added if adding the event will not cause a double booking. |
11 |
| - * Your class will have the method, book(int start, int end). |
12 |
| - * Formally, this represents a booking on the half open interval [start, end), |
13 |
| - * the range of real numbers x such that start <= x < end. |
14 |
| - * A double booking happens when two events have some non-empty intersection (ie., there is some time that is common to both events.) |
15 |
| - * For each call to the method MyCalendar.book, |
16 |
| - * return true if the event can be added to the calendar successfully without causing a double booking. |
17 |
| - * Otherwise, return false and do not add the event to the calendar. |
18 |
| -
|
19 |
| - Your class will be called like this: MyCalendar cal = new MyCalendar(); MyCalendar.book(start, end) |
20 |
| -
|
21 |
| - Example 1: |
22 |
| - MyCalendar(); |
23 |
| - MyCalendar.book(10, 20); // returns true |
24 |
| - MyCalendar.book(15, 25); // returns false |
25 |
| - MyCalendar.book(20, 30); // returns true |
26 |
| -
|
27 |
| - Explanation: |
28 |
| -
|
29 |
| - The first event can be booked. The second can't because time 15 is already booked by another event. |
30 |
| - The third event can be booked, as the first event takes every time less than 20, but not including 20. |
31 |
| - Note: |
32 |
| -
|
33 |
| - The number of calls to MyCalendar.book per test case will be at most 1000. |
34 |
| - In calls to MyCalendar.book(start, end), start and end are integers in the range [0, 10^9]. |
35 |
| -
|
36 |
| - */ |
37 | 7 | public class _729 {
|
38 | 8 | public static class Solution1 {
|
39 | 9 | /**
|
|
0 commit comments