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 most400
. - In calls to
MyCalendarThree.book(start, end)
,start
andend
are integers in the range[0, 10^9]
.
思路:还是建议用标准的 sweep line的代码写,比较标准化,可以解所有的题;
class MyCalendarThree {
private class Node {
public int index;
public int flag;
public Node(int index, int flag) {
this.index = index;
this.flag = flag;
}
}
private List<Node> list;
public MyCalendarThree() {
list = new ArrayList<Node>();
}
public int book(int start, int end) {
list.add(new Node(start, 1));
list.add(new Node(end, -1));
Collections.sort(list, (a, b) -> (a.index != b.index ? a.index - b.index : a.flag - b.flag));
int count = 0;
int maxcount = 0;
for(Node node: list) {
if(node.flag == 1) {
count++;
} else {
count--;
}
maxcount = Math.max(maxcount, count);
}
return maxcount;
}
}
/**
* Your MyCalendarThree object will be instantiated and called as such:
* MyCalendarThree obj = new MyCalendarThree();
* int param_1 = obj.book(start,end);
*/
思路:跟 My Calendar II 类似 ,求overlap的最大; 扫描线;求中间count的最大值;
class MyCalendarThree {
TreeMap<Integer, Integer> treeMap;
public MyCalendarThree() {
treeMap = new TreeMap<Integer, Integer>();
}
public int book(int start, int end) {
// add it;
treeMap.put(start, treeMap.getOrDefault(start, 0) + 1);
treeMap.put(end, treeMap.getOrDefault(end, 0) - 1);
// check if sweep line count;
int count = 0;
int maxcount = 0;
for(Integer key: treeMap.keySet()) {
count += treeMap.get(key);
maxcount = Math.max(maxcount, count);
}
return maxcount;
}
}
/**
* Your MyCalendarThree object will be instantiated and called as such:
* MyCalendarThree obj = new MyCalendarThree();
* int param_1 = obj.book(start,end);
*/