maximum-consecutive-floors-without-special-floors

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Alice manages a company and has rented some floors of a building as office space. Alice has decided some of these floors should be special floors, used for relaxation only.

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> (inclusive). 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.

Return the maximum number of consecutive floors without a special floor.

&nbsp;
Example 1:

<pre>
Input: bottom = 2, top = 9, special = [4,6]
Output: 3
Explanation: 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>

Example 2:

<pre>
Input: bottom = 6, top = 8, special = [7,6,8]
Output: 0
Explanation: Every floor rented is a special floor, so we return 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= special.length &lt;= 105</code></li>
	<li><code>1 &lt;= bottom &lt;= special[i] &lt;= top &lt;= 109</code></li>
	<li>All the values of <code>special</code> are unique.</li>
</ul>

maxConsecutive

Maximum Consecutive Floors Without Special Floors

Longest Consecutive Sequence

longest-consecutive-sequence

最长连续序列

Maximum Gap

maximum-gap

最大间距

Widest Vertical Area Between Two Points Containing No Points

widest-vertical-area-between-two-points-containing-no-points

两点之间不包含任何点的最宽垂直区域

Array

Sorting

Alice 管理着一家公司，并租用大楼的部分楼层作为办公空间。Alice 决定将一些楼层作为 特殊楼层 ，仅用于放松。

给你两个整数 <code>bottom</code> 和 <code>top</code> ，表示 Alice 租用了从 <code>bottom</code> 到 <code>top</code>（含 <code>bottom</code> 和 <code>top</code> 在内）的所有楼层。另给你一个整数数组 <code>special</code> ，其中 <code>special[i]</code> 表示&nbsp; Alice 指定用于放松的特殊楼层。

返回不含特殊楼层的 最大 连续楼层数。

&nbsp;

示例 1：

<pre>
输入：bottom = 2, top = 9, special = [4,6]
输出：3
解释：下面列出的是不含特殊楼层的连续楼层范围：
- (2, 3) ，楼层数为 2 。
- (5, 5) ，楼层数为 1 。
- (7, 9) ，楼层数为 3 。
因此，返回最大连续楼层数 3 。
</pre>

示例 2：

<pre>
输入：bottom = 6, top = 8, special = [7,6,8]
输出：0
解释：每层楼都被规划为特殊楼层，所以返回 0 。
</pre>

&nbsp;

提示

<ul>
	<li><code>1 &lt;= special.length &lt;= 105</code></li>
	<li><code>1 &lt;= bottom &lt;= special[i] &lt;= top &lt;= 109</code></li>
	<li><code>special</code> 中的所有值 互不相同</li>
</ul>