732. My Calendar III

Implement a MyCalendarThree class to store your events. A new event can always be added.

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 K-booking happens when K events have some non-empty intersection (ie., there is some time that is common to all K events.)

For each call to the method MyCalendar.book, return an integer K representing the largest integer such that there exists a K-booking in the calendar.

Your class will be called like this:  MyCalendarThree cal = new MyCalendarThree();  MyCalendarThree.book(start, end)

Example 1:

MyCalendarThree();
MyCalendarThree.book(10, 20); // returns 1
MyCalendarThree.book(50, 60); // returns 1
MyCalendarThree.book(10, 40); // returns 2
MyCalendarThree.book(5, 15); // returns 3
MyCalendarThree.book(5, 10); // returns 3
MyCalendarThree.book(25, 55); // returns 3
Explanation: 
The first two events can be booked and are disjoint, so the maximum K-booking is a 1-booking.
The third event [10, 40) intersects the first event, and the maximum K-booking is a 2-booking.
The remaining events cause the maximum K-booking to be only a 3-booking.
Note that the last event locally causes a 2-booking, but the answer is still 3 because
eg. [10, 20), [10, 40), and [5, 15) are still triple booked.

Note:

• The number of calls to MyCalendarThree.book per test case will be at most 400.
• In calls to MyCalendarThree.book(start, end), start and end are integers in the range [0, 10^9].

  实现一个MyCalendarThree类，其中包含一个方法book，用来预约时间段。是MyCalendar系列的第三道题...时间段可以重叠，book返回：与给定的时间段（参数）相交的各个时间段中叠加层数最多的时间段的叠加层数。需要想一个办法描述时间段，这里的想法是，只记录每个时间段的开头和叠加层数，分别对应于一个映射表中的键和值。不记录结尾是因为下一段时间段的开头即为现在的时间段的结尾。当book的时候，根据给定的时间段，找出有相交的各个时间段，如果开头或者结尾是严格的相交而不是覆盖，要进行分割（也就是在映射表中新增记录）。相交的部分叠加层数都加1。最后返回叠加层数的最大值。

  
  

  代码：

  class MyCalendarThree {
  public:
      MyCalendarThree() {
          ret = 0;
          times[0] = 0;
          times[1000000000] = 0;
      }
      
      int book(int start, int end) {
          auto iter = times.lower_bound(start);
          if(iter->first != start) {
              iter = prev(iter);
              times[start] = iter->second;
              iter = next(iter);
          }
          int max_val = 0, pre_val;
          while(true) {
              if(iter->first < end) {
                  iter->second++;
                  max_val = max(max_val, iter->second);
              }
              else {
                  if(iter->first != end) {
                      auto pre = prev(iter);
                      times[end] = pre->second-1;
                  }
                  break;
              }
              pre_val = iter->second;
              iter = next(iter);
          }
          ret = max(ret, max_val);
          return ret;
      }
  private:
      int ret;
      map<int, int> times;
  };