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

  思路：

  定义两个数据结构，一个是vector<pair<int, int>> st，用来表示所有的segments；另一个是map<int, int>，用来表示每个起始结点所对应的overlap的数量。那么线段[s,e)可以被插入的充要条件就是：1）被[s,e)包含起始点中，count没有为2的（否则插入[s,e)之后，起始点s的count就为3了）；2）包含s的所有起始点的count没有为2的（否则加上[s,e)之后，它的count就超过2了）。如果这两个条件都被满足了，我们需要做两件事情：1）更新所有被[s,e)包围的起始点的count；2）将s及其对应的count加入线段树中。

  代码：

  class MyCalendarTwo {
  public:
      MyCalendarTwo() {
          
      }
      
      bool book(int s, int e) {
          // step 1: try fo find whether segments intersect with [s,e) have count 2
          for (auto it = mp.lower_bound(s); it != mp.end() && it->first < e; ++it) {
              if (it->second >= 2) {
                  return false;
              }
          }
          // step 2: calculate how many start point covers s
          int cnt = 0;
          for (auto &v : st) {
              if (v.first <= s && v.second > s) {
                  ++cnt;
              }
          }
          if (cnt >= 2) {
              return false;
          }
          // step 3: update the start points who are covered by [s,e)
          for (auto it = mp.lower_bound(s); it != mp.end() && it->first < e; ++it) {
              ++it->second;
          }
          mp[s] = cnt + 1;
          st.push_back({s,e});
          return true;
      }
  private:
      vector<pair<int,int>> st;   // all the segments
      map<int,int> mp;            // map from start points to counts
  };
  
  /**
   * Your MyCalendarTwo object will be instantiated and called as such:
   * MyCalendarTwo obj = new MyCalendarTwo();
   * bool param_1 = obj.book(start,end);
   */