LeetCode 732. My Calendar III

原题链接在这里：https://leetcode.com/problems/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].

题解：

Maintain the ongoing events by plus one at each booking start and minus one at each booling end.

Accumlate ongoing events count and return the maximum.

It could array to maintain such events, but input may be sparse. Thus it would be better to use TreeMap.

Time Complexity: book, O(nlogn). n is size of tm.

Space: O(n).

AC Java:

 class MyCalendarThree {
     TreeMap<Integer, Integer> tm;

     public MyCalendarThree() {
         tm = new TreeMap<>();
     }

     public int book(int start, int end) {
         tm.put(start, tm.getOrDefault(start, 0)+1);
         tm.put(end, tm.getOrDefault(end, 0)-1);

         int res = 0;
         int ongoing = 0;
         for(int count : tm.values()){
             ongoing += count;
             res = Math.max(res, ongoing);
         }

         return res;
     }
 }

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

类似My Calendar I, My Calendar II.