LEETCODE: 729. My Calendar I & 731. My Calendar II

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].

主要是需要记录下已经被book了的时间段。这里我用的是 STL 里面的 map：

map<int, int> occupied; 

map是有序的，为了提高效率，我在代码里面用 index 记住要插入的新纪录的可能位置。如果当前新插入的记录和原有记录没有交集，那么就插入，返回 true。否则，返回 false。

class MyCalendar {
public:
    MyCalendar() {
    }

    bool book(int start, int end) {
        map<int, int>::iterator index = occupied.begin();
        map<int, int>::iterator it = index;
        for(; it != occupied.end(); it ++) {
            if(start >= (*it).second) {
                index = it;
                continue;
            }
            else if(end <= (*it).first) {
                continue;
            }
            return false;
        }
        occupied.insert(index, pair<int,int>(start, end));
        return true;
    }
private:
    map<int, int> occupied;    
};

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

731. My Calendar II

Implement a MyCalendarTwo class to store your events. A new event can be added if adding the event will not cause a triple booking.

Your class will have one 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 triple booking happens when three events have some non-empty intersection (ie., there is some time that is common to all 3 events.)

For each call to the method MyCalendar.book, return true if the event can be added to the calendar successfully without causing a triple 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(50, 60); // returns true
MyCalendar.book(10, 40); // returns true
MyCalendar.book(5, 15); // returns false
MyCalendar.book(5, 10); // returns true
MyCalendar.book(25, 55); // returns true

Explanation:
The first two events can be booked. The third event can be double booked.
The fourth event (5, 15) can’t be booked, because it would result in a triple booking.
The fifth event (5, 10) can be booked, as it does not use time 10 which is already double booked.
The sixth event (25, 55) can be booked, as the time in [25, 40) will be double booked with the third event;
the time [40, 50) will be single booked, and the time [50, 55) will be double booked with the second event.
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].

这个题目和上面一个的区别在于，上面的是一旦有冲突，就不能 book。这里，是第二次有冲突的时候，才不能 book。那么需要有一个新的地方来记录那些区段已经有冲突了。

set<pair<int, int>> conflicts;

只有和已经被占用的那些区段发生冲突的，才能够被加到 conflicts 里面。

for(; it != occupied.end(); it++) {
    if(start >= (*it).second || end <= (*it).first)
        continue;
    conflicts.insert(pair<int,int>(max(start, (*it).first), min(end, (*it).second)));
}

如果一个新的 start， end 和已有的 conflicts 有冲突，那么他们就不满足要求。

set<pair<int, int>>::iterator it = conflicts.begin();
for(; it != conflicts.end(); it++) {
       if(start >= (*it).second || end <= (*it).first)
           continue;
       return false;
   }
}

把这些代码合在一起：

class MyCalendarTwo {
public:
   MyCalendarTwo() {

   }

    double max(int a, int b) {
        return a > b ? a : b;
    }

    double min(int a, int b) {
        return a > b ? b : a;
    }

   bool book(int start, int end) {
       set<pair<int, int>>::iterator it = conflicts.begin();
       for(; it != conflicts.end(); it++) {
           if(start >= (*it).second || end <= (*it).first)
               continue;
           return false;
       }
       it = occupied.begin();
       for(; it != occupied.end(); it++) {
           if(start >= (*it).second || end <= (*it).first)
               continue;
           conflicts.insert(pair<int,int>(max(start, (*it).first), min(end, (*it).second)));
       }
       occupied.insert(pair<int,int>(start, end));
       return true;
   }
private:
   set<pair<int, int>> occupied;
    set<pair<int, int>> conflicts;
};
/**
 * Your MyCalendarTwo object will be instantiated and called as such:
 * MyCalendarTwo obj = new MyCalendarTwo();
 * bool param_1 = obj.book(start,end);
 */