729. My Calendar I && 731. My Calendar II && 732. My Calendar III

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].
• 
  
• Brute force即可AC，可以用TreeMap优化

• class MyCalendar:
  
      def __init__(self):
          self.intervals = []
  
      def book(self, start, end):
          """
          :type start: int
          :type end: int
          :rtype: bool
          """
          for s,t in self.intervals:
              if not (start>=t or end<=s):  return False
          self.intervals.append([start, end])
          return True
  
  
  # Your MyCalendar object will be instantiated and called as such:
  obj = MyCalendar()
  print(obj.book(10, 20)); 
  print(obj.book(15, 25)); 
  print(obj.book(20, 30)); 

  
  
  
• 
  
• 
  
• 
  
• 
  

• 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].
• 
  
• 在加一个list判断就好啦

• class MyCalendarTwo:
  
      def __init__(self):
          self.intervals = []
          self.marked = []
  
      def book(self, start, end):
          """
          :type start: int
          :type end: int
          :rtype: bool
          """
          '''can ba added ? '''
          ok = True
          for s,t in self.intervals:
              if not ok: break
              if not (start>=t or end<=s):
                  interS, interT = max(s,start), min(t,end)
                  for ss, tt in self.marked:
                      if not (interS>=tt or interT<=ss):
                          ok = False
                          break
          '''add if ok'''
          if ok:
              for s,t in self.intervals:
                  if not (start>=t or end<=s):
                      interS, interT = max(s,start), min(t,end)
                      self.marked.append([interS, interT])
                      
              '''just add all range afterwards'''
              self.intervals.append([start, end])     
                 
          return ok
  
  
  # Your MyCalendarTwo object will be instantiated and called as such:
  obj = MyCalendarTwo()
  print(obj.book(10, 20)); 
  print(obj.book(50, 60)); 
  print(obj.book(10, 40)); 
  print(obj.book(5, 15)); 
  print(obj.book(5, 10)); 
  print(obj.book(25, 55)); 

• 
  
• 
  
• 
  
• 
  
  
  

• 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].
  
• 关键是start和end 2个节点的信息，只要确认了2头的信息，就可以推出每个interval的信息

• The logic is: let's walk though the start and end time points one by one in sorting order. If the point is start, increase one. If the point is end, decrease one. The sum is always greater or equal than 0, and it is the overlap number between the previous time to the next time.

  This method can be used to solve My Calendar I and II as well.

  
  

• package l732;
  
  import java.util.TreeMap;
  
  class MyCalendarThree {
  	
  	TreeMap<Integer, Integer> map = new TreeMap<Integer, Integer>();
  
      public MyCalendarThree() {
          
      }
      
      public int book(int start, int end) {
      	map.put(start, map.containsKey(start)?map.get(start)+1:1);
      	map.put(end, map.containsKey(end)?map.get(end)-1:-1);
      	int max = 0, running = 0;
      	for(int k : map.keySet()){
      		running += map.get(k);
      		max = Math.max(max, running);
      	}
      	return max;
      }
  }
  
  /**
   * Your MyCalendarThree object will be instantiated and called as such:
   * MyCalendarThree obj = new MyCalendarThree();
   * int param_1 = obj.book(start,end);
   */