leetcode 729|731|732. My Calendar 1|2|3

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

  class MyCalendar {
  public:
      MyCalendar() 
      {
      }
      
      bool book(int start, int end) 
      {
          if (mp.empty())
          {
              mp[start] = end;
              return true;
          }
          
          for (auto it = mp.begin(); it != mp.end(); it++)
          {
              if (start >= it->second)
                  continue;
              if (end <= it->first)
              {
                  mp[start] = end;
                  return true;  
              }
              return false;
          }    
          
          mp[start] = end;
          return true;
      }
  private:
      map<int, int> mp;  //记录的是 一段的开始和结束
  };
  
  /**
   * Your MyCalendar object will be instantiated and called as such:
   * MyCalendar obj = new MyCalendar();
   * bool param_1 = obj.book(start,end);
   */

  
  
  

  class MyCalendar {
  public:
      MyCalendar() 
      {
      }
      
      bool book(int start, int end) 
      {
          m[start] ++;  
          m[end] --;  
          int s = 0;  
          for (auto it : m)   
          {  
              s += it.second;  
              if (s >= 2)   
              {  
                  m[end] ++;  
                  m[start] --;  
                  return false;  
              }  
          }  
          return true;
      }
  private:
      map<int, int> m;   //记录的是时间点位
  };
  
  /**
   * 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 triplebooking.

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

  自己最开始写得特别麻烦。然后超时。然后网上发现了累计法。

  class MyCalendarTwo {
  public:
      map<int, int> m;
      MyCalendarTwo() {
      }
  
      bool book(int start, int end) 
      {
          m[start] ++;
          m[end] --;
          int s = 0;
          for (auto it : m) 
          {
              s += it.second;
              if (s >= 3) 
              {
                  m[end] ++;
                  m[start] --;
                  return false;
              }
          }
          return true;
      }
  };

  
  

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

  1、选择用扫描线来做
  

  2、multiset<自定义类型，compare> 这种用法一定要记住！

  struct mycompare
  {
      bool operator()(const pair<int, int>& a, const pair<int, int>& b) const   
      {
          if (a.first == b.first)
              return a.second < b.second;
          return a.first < b.first;
      }
  };
  
  class MyCalendarThree {
  public:
      MyCalendarThree() {  
      }
      
      int book(int start, int end) 
      {
          mst.insert(make_pair(start, 1));
          mst.insert(make_pair(end, 0));
          return findmax();
      }
  
  private:
      multiset<pair<int, int>, mycompare> mst;  // 1代表进入， 0 代表退出。
      int findmax()
      {
          int ret = 0;
          int now_thing = 0;
          for (auto it = mst.begin(); it != mst.end(); it++)
          {
              if ((*it).second == 1)
                  now_thing++;
              else
                  now_thing--;
              ret = max(ret, now_thing);
          }
          return ret;
      }
  };
  
  /**
   * Your MyCalendarThree object will be instantiated and called as such:
   * MyCalendarThree obj = new MyCalendarThree();
   * int param_1 = obj.book(start,end);
   */

  
  网上看了上一个题的解法，自己写了一个简单的。累计法。

  class MyCalendarThree {
  public:
      map<int, int> mp;
      MyCalendarThree() {  
      }
      
      int book(int start, int end) 
      {
          mp[start] ++;
          mp[end] --;
          int s = 0;
          int ret = 0;
          for (auto it : mp)
          {
              s += it.second;
              ret = max(ret, s);
          }
          return ret;
      }
  };