[LC] 729. My Calendar I

标签：private   new   hat   you   key   OLE   each   present   als   

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.

class MyCalendar {
    private TreeMap<Integer, Integer> map;
    public MyCalendar() {
       map = new TreeMap<>();
    }
    
    public boolean book(int start, int end) {
        Integer floor = map.floorKey(start);
        if (floor != null && map.get(floor) > start) {
            return false;
        }
        Integer ceiling = map.ceilingKey(start);
        if (ceiling != null && ceiling < end) {
            return false;
        }
        map.put(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);
 */

[LC] 729. My Calendar I

标签：private   new   hat   you   key   OLE   each   present   als   

原文地址：https://www.cnblogs.com/xuanlu/p/12491306.html