mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
36 lines
1.6 KiB
HTML
36 lines
1.6 KiB
HTML
<p>Alice manages a company and has rented some floors of a building as office space. Alice has decided some of these floors should be <strong>special floors</strong>, used for relaxation only.</p>
|
|
|
|
<p>You are given two integers <code>bottom</code> and <code>top</code>, which denote that Alice has rented all the floors from <code>bottom</code> to <code>top</code> (<strong>inclusive</strong>). You are also given the integer array <code>special</code>, where <code>special[i]</code> denotes a special floor that Alice has designated for relaxation.</p>
|
|
|
|
<p>Return <em>the <strong>maximum</strong> number of consecutive floors without a special floor</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> bottom = 2, top = 9, special = [4,6]
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> The following are the ranges (inclusive) of consecutive floors without a special floor:
|
|
- (2, 3) with a total amount of 2 floors.
|
|
- (5, 5) with a total amount of 1 floor.
|
|
- (7, 9) with a total amount of 3 floors.
|
|
Therefore, we return the maximum number which is 3 floors.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> bottom = 6, top = 8, special = [7,6,8]
|
|
<strong>Output:</strong> 0
|
|
<strong>Explanation:</strong> Every floor rented is a special floor, so we return 0.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= special.length <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= bottom <= special[i] <= top <= 10<sup>9</sup></code></li>
|
|
<li>All the values of <code>special</code> are <strong>unique</strong>.</li>
|
|
</ul>
|