问题:
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 MyCalendar.book
, 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();
MyCalendar.book(start, end)
Example 1:
MyCalendar(); MyCalendar.book(10, 20); // returns true MyCalendar.book(15, 25); // returns false MyCalendar.book(20, 30); // returns true Explanation: 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.
Note:
- The number of calls to
MyCalendar.book
per test case will be at most1000
. - In calls to
MyCalendar.book(start, end)
,start
andend
are integers in the range[0, 10^9]
.
解决:
【题意】
日程设计
要求两个日程范围不存在重复。
每次添加时需要和以往所有的日程进行比较。才可以确实是否可以添加。
①
重叠的情况如下:
a为已存在日程,b为待添加日程。
a a0 l------------l a1
b b0 l----l b1
a a0 l------------l a1
b b0 l---------l b1
a a0 l------------l a1
b b0 l------l b1
根据以上重叠情况,可以得到一个抽象的描述
max(a0, b0) < min(a1, b1)
class MyCalendar { //146ms
List<int[]> books;
public MyCalendar() {
books = new ArrayList<>();
}
public boolean book(int start, int end) {
for (int[] b : books){
if (Math.max(b[0],start) < Math.min(b[1],end)) return false;
}
books.add(new int[] {start,end});
return true;
}
}
/**
* Your MyCalendar object will be instantiated and called as such:
* MyCalendar obj = new MyCalendar();
* boolean param_1 = obj.book(start,end);
*/