mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
40 lines
1.6 KiB
HTML
40 lines
1.6 KiB
HTML
<p>A <code>k</code>-booking happens when <code>k</code> events have some non-empty intersection (i.e., there is some time that is common to all <code>k</code> events.)</p>
|
|
|
|
<p>You are given some events <code>[startTime, endTime)</code>, after each given event, return an integer <code>k</code> representing the maximum <code>k</code>-booking between all the previous events.</p>
|
|
|
|
<p>Implement the <code>MyCalendarThree</code> class:</p>
|
|
|
|
<ul>
|
|
<li><code>MyCalendarThree()</code> Initializes the object.</li>
|
|
<li><code>int book(int startTime, int endTime)</code> Returns an integer <code>k</code> representing the largest integer such that there exists a <code>k</code>-booking in the calendar.</li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input</strong>
|
|
["MyCalendarThree", "book", "book", "book", "book", "book", "book"]
|
|
[[], [10, 20], [50, 60], [10, 40], [5, 15], [5, 10], [25, 55]]
|
|
<strong>Output</strong>
|
|
[null, 1, 1, 2, 3, 3, 3]
|
|
|
|
<strong>Explanation</strong>
|
|
MyCalendarThree myCalendarThree = new MyCalendarThree();
|
|
myCalendarThree.book(10, 20); // return 1
|
|
myCalendarThree.book(50, 60); // return 1
|
|
myCalendarThree.book(10, 40); // return 2
|
|
myCalendarThree.book(5, 15); // return 3
|
|
myCalendarThree.book(5, 10); // return 3
|
|
myCalendarThree.book(25, 55); // return 3
|
|
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>0 <= startTime < endTime <= 10<sup>9</sup></code></li>
|
|
<li>At most <code>400</code> calls will be made to <code>book</code>.</li>
|
|
</ul>
|