My Calendar I

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 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 most 1000.
• In calls to MyCalendar.book(start, end), start and end are integers in the range [0, 10^9].

1.解析

题目大意，判断新增加的间隔是否存在重叠部分。

2.分析

总体来说，这道题还是蛮简单的。但我刚开始没想出来，我陷在如何合并间隔上，其实本身是不需要合并的，只需要判断插入的间隔是否和之前插入的存在重叠即可。参考@Grandyang博主的思路，用一个hashtree保存之前插入的结果，利用lower_bound函数查找到第一个key值不小于start的元素。 判断是否存在重叠的部分，实际上只需要考虑以下两种情况：

①若查找到的一个key值大于当前start的元素，判断end是否在当前元素的范围内，如果在，则存在重叠。例如：

[10, 20]，[20, 30]  查找[15, 25]，25位于[20, 30]内

②若查找到的一个key值大于当前start的元素，判断start是否在前一个元素的范围内，如果在，则存在重叠。例如：

[10, 20]，[20, 30]  查找[15, 25]，15位于[10, 20]内

class MyCalendar {
public:
    MyCalendar() {
        
    }
    
    bool book(int start, int end) {
        auto it = interval.lower_bound(start);
        if (it != interval.end() && it->first < end) return false;
        if (it != interval.begin() && prev(it)->second > start) return false;
        interval[start] = end; //其他情况都是不存在重叠部分的
        return true;
    }
private:
    map<int, int> interval;
};

/**
 * Your MyCalendar object will be instantiated and called as such:
 * MyCalendar* obj = new MyCalendar();
 * bool param_1 = obj->book(start,end);
 */

 [1]https://www.cnblogs.com/grandyang/p/7920253.html